TY - GEN
T1 - Efficient processing of top-k queries in uncertain databases
AU - Yi, Ke
AU - Li, Feifei
AU - Kollios, George
AU - Srivastava, Divesh
PY - 2008
Y1 - 2008
N2 - This work introduces novel polynomial-time 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. Our results significantly improve the best known algorithms for top-k query processing in uncertain databases, In terms of both running time and memory usage. Focusing on the single-alternative case, the new algorithms are orders of magnitude faster.
AB - This work introduces novel polynomial-time 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. Our results significantly improve the best known algorithms for top-k query processing in uncertain databases, In terms of both running time and memory usage. Focusing on the single-alternative case, the new algorithms are orders of magnitude faster.
UR - https://www.webofscience.com/wos/woscc/full-record/WOS:000257282600169
UR - https://openalex.org/W2125402103
UR - https://www.scopus.com/pages/publications/51149107502
U2 - 10.1109/ICDE.2008.4497571
DO - 10.1109/ICDE.2008.4497571
M3 - Conference Paper published in a book
SN - 9781424418374
T3 - Proceedings - International Conference on Data Engineering
SP - 1406
EP - 1408
BT - Proceedings of the 2008 IEEE 24th International Conference on Data Engineering, ICDE'08
T2 - 2008 IEEE 24th International Conference on Data Engineering, ICDE'08
Y2 - 7 April 2008 through 12 April 2008
ER -