Probabilistic Ranking Over Relations

Probabilistic top-k ranking queries have been extensively studied due to the fact that data obtained can be uncertain in many real applications. A probabilistic top-k ranking query ranks objects by the interplay of score and probability, with an implicit assumption that both scores based on which objects are ranked and probabilities of the existence of the objects are stored in the same relation. The authors observe that in general scores and probabilities are highly possible to be stored in different relations, for example, in column-oriented DBMSs and in data warehouses.

Provided by: Association for Computing Machinery Topic: Big Data Date Added: Mar 2010 Format: PDF

Download Now

Find By Topic