Efficient Processing of Top-k Queries in Uncertain Databases with x-Relations

Provided by: Institute of Electrical & Electronic Engineers
Topic: Big Data
Format: PDF
In this paper, the authors introduce novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a number of x-tuples, and each x-tuple randomly instantiates into one tuple from one or more alternatives. Their results significantly improve the best known algorithms for top-k query processing in uncertain databases, in terms of both runtime and memory usage. In the single-alternative case, the new algorithms are 2 to 3 orders of magnitude faster than the previous algorithms.

Find By Topic