Top-k queries on uncertain data: On score distribution and typical answers

SIGMOD-PODS'09 - Proceedings of the International Conference on Management of Data and 28th Symposium on Principles of Database Systems

Volumn , Issue , 2009, Pages 375-387

  Ge, Tingjian ^a   Zdonik, Stan ^a   Madden, Samuel ^b  

^a Brown Univerity   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Distribution; Top k; Typical; Uncertain data

Indexed keywords

DATA INTEGRATION; DATA SETS; EFFICIENT ALGORITHM; EMPIRICAL STUDIES; HIGH PROBABILITY; SYNTHETIC DATASETS; TOP-K QUERY; UNCERTAIN DATAS;

ALGORITHMS; DATA HANDLING; DATABASE SYSTEMS; INFORMATION RETRIEVAL; SEMANTICS; SENSOR NETWORKS; VECTORS;

PROBABILITY DISTRIBUTIONS;

EID: 70849108163     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1559845.1559886     Document Type: Conference Paper

References (24)

1. L. Antova, T. Jansen, C. Koch, D. Olteanu. Fast and Simple Relational Processing of Uncertain Data. In ICDE, 2008.
2. R. Bellman. Dynamic Programming. Princeton Univ. Press, 1957.
3. R. Cheng, D. Kalashnikov, and S. Prabhakar. Evaluating probabilistic queries over imprecise data. In SIGMOD, 2003.
4. T. Cover and J. Thomas. Elements of Information Theory. A Wiley-Interscience Publication, 1991.
5. N. Dalvi and D. Suciu. Efficient Query Evaluation on Probabilistic Databases. In VLDB, 2004.
6. N. Dalvi and D. Suciu. Management of Probabilistic Data: Foundations and Challenges. In PODS, 2007.
7. R. Fagin, R. Kumar, M. Mahdian, D. Sivakumar, and E. Vee. Comparing and Aggregating Rankings with Ties. In PODS, 2004.
8. R. Hassin and A. Tamir. Improved complexity bounds for location problems on the real line. In Operations Research Letters, 1991.
9. M. Hua, J. Pei, W. Zhang, X. Lin. Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach. In SIGMOD, 2008.
10. B. Hull, V. Bychkovsky, Y. Zhang, K. Chen, M. Goraczko, E. Shih, H. Balakrishnan, and S. Madden. CarTel: A Distributed Mobile Sensor Computing System. In SenSys, 2006.
11. I. Ilyas, G. Beskales, and M. Soliman. A Survey of Top-k Query Processing Techniques in Relational Database Systems. In ACM Computing Surveys, Vol. 40, 2008.
12. R. Jampani, F. Xu, M. Wu, L. Perez, C. Jermaine, and P. Haas. MCDB: A Monte Carlo Approach to Managing Uncertain Data. In SIGMOD, 2008.
13. C. Jin, K. Yi, L. Chen, J. Yu, X. Lin. Sliding-Window Top-k Queries on Uncertain Streams. In VLDB, 2008.
14. S. Lim, H. Balakrishnan, D. Gifford, S. Madden, D. Rus. Stochastic Motion Planning and Applications to Traffic. In WAFR, 2008.
15. C. Re, N. Dalvi and D. Suciu. Efficient Top-k Query Evaluation on Probabilistic Data. In ICDE, 2007.
16. K. Rosen. Discrete Mathematics and Its Applications. 1995.
17. P. Sen and A. Deshpande. Representing and Querying Correlated Tuples in Probabilistic Databases. In ICDE, 2007.
18. M. Soliman, I. Ilyas, and K. Chang. Top-k Query Processing in Uncertain Databases. In ICDE, 2007.
19. N. Tatbul, M. Buller, R. Hoyt, S. Mullen, S. Zdonik. Confidence-based Data Management for Personal Area Sensor Networks. In DMSN, 2004.
20. J. Widom. Trio: A system for integrated management of data, accuracy, and lineage. In CIDR, 2005.
21. K. Yi, F. Li, G. Kollios, D. Srivastava. Efficient Processing of Top-k Queries in Uncertain Databases with x-Relations. In TKDE, 2008.
22. X. Zhang and J. Chomicki. On the Semantics and Evaluation of Top-k Queries in Probabilistic Databases. In DBRank'08.
23. The R Project for Statistical Computing: www.r-project.org.
24. http://en.wikipedia.org/wiki/Edit distance.