Efficient processing of top-k queries in uncertain databases

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2008, Pages 1406-1408

  Yi, Ke ^a   Li, Feifei ^b   Kollios, George ^c   Srivastava, Divesh ^d  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b Florida State University

^c BOSTON UNIVERSITY   (United States)

^d AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BEST-KNOWN ALGORITHMS; DATA ENGINEERING; INTERNATIONAL CONFERENCES; MEMORY USAGE; ORDERS-OF-MAGNITUDE; POLYNOMIAL-TIME ALGORITHMS; RUNNING TIME; TOP-K QUERIES; TOP-K QUERY PROCESSING;

DATABASE SYSTEMS; INFORMATION RETRIEVAL; QUERY PROCESSING; TECHNOLOGY;

DATA STORAGE EQUIPMENT;

EID: 51149107502     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2008.4497571     Document Type: Conference Paper

References (3)

1. P. Agrawal, O. Benjelloun, A. Das Sarma, C. Hayworth, S. Nabar, T. Sugihara, and J. Widom, "Trio: A system for data, uncertainty, and lineage," in VLDB, 2006.
2. M. A. Soliman, I. F. Ilyas, and K. C. Chang, "Top-k query processing in uncertain databases," in ICDE, 2007.
3. K. Yi, F. Li, D. Srivastava, and G. Kollios, "Efficient processing of top-k queries in uncertain databases," Florida State University, Tech. Rep., 2008.