Semantics of ranking queries for probabilistic data and expected ranks

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 305-316

  Cormode, Graham ^a   Li, Feifei ^b   Yi, Ke ^c  

^a AT AND T LABS RESEARCH   (United States)

^b FLORIDA STATE UNIVERSITY   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

QUERY PROCESSING; SEMANTICS;

ATTRIBUTE LEVELS; DETERMINISTIC DATA; FUNDAMENTAL PROPERTIES; MASSIVE QUANTITIES; PROBABILISTIC DATA; PROBABILISTIC DATABASE; PRUNING TECHNIQUES; SCORING FUNCTIONS;

QUERY LANGUAGES;

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

References (39)

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. L. Antova, C. Koch, and D. Olteanu, "10106 worlds and beyond: Efficient representation and processing of incomplete information," in ICDE, 2007.
3. L. Antova, T. Jansen, C. Koch, and D. Olteanu, "Fast and simple relational processing of uncertain data," in ICDE, 2008.
4. O. Benjelloun, A. D. Sarma, A. Halevy, and J. Widom, "ULDBs: databases with uncertainty and lineage," in VLDB, 2006.
5. G. Beskales, M. A. Soliman, and I. F. Ilyas, "Efficient search for the topk probable nearest neighbors in uncertain databases," in VLDB, 2008.
6. S. Borzsonyi, D. Kossmann, and K. Stocker, "The skyline operator," in ICDE, 2001.
7. S. Chaudhuri, K. Ganjam, V. Ganti, and R. Motwani, "Robust and efficient fuzzy match for online data cleaning," in SIGMOD, 2003.
8. R. Cheng, J. Chen, M. Mokbel, and C.-Y. Chow, "Probabilistic verifiers: Evaluating constrained nearest-neighbor queries over uncertain data," in ICDE, 2008.
9. R. Cheng, D. Kalashnikov, and S. Prabhakar, "Evaluating probabilistic queries over imprecise data," in SIGMOD, 2003.
10. N. Dalvi and D. Suciu, "Efficient query evaluation on probabilistic databases," VLDB Journal, vol. 16, no. 4, pp. 523-544, 2007.
11. A. Deshpande, C. Guestrin, S. Madden, J. Hellerstein, and W. Hong, "Model-driven data acquisition in sensor networks," in VLDB, 2004.
12. C. Dwork, R. Kumar, M. Naor, and D. Sivakumar, "Rank aggregation methods for the web," in WWW Conference, 2001.
13. R. Fagin, A. Lotem, and M. Naor, "Optimal aggregation algorithms for middleware," in PODS, 2001.
14. A. Fuxman, E. Fazli, and R. J. Miller, "ConQuer: efficient management of inconsistent databases," in SIGMOD, 2005.
15. A. Halevy, A. Rajaraman, and J. Ordille, "Data integration: the teenage year," in VLDB, 2006.
16. M. A. Hernandez and S. J. Stolfo, "Real-world data is dirty: Data cleansing and the merge/purge problem," Data Mining and Knowledge Discovery, vol. 2, no. 1, pp. 9-37, 1998.
17. M. Hua, J. Pei, W. Zhang, and X. Lin, "Efficiently answering probabilistic threshold top-k queries on uncertain data," in ICDE, 2008.
18. M. Hua, J. Pei, W. Zhang, and X. Lin, "Ranking queries on uncertain data: A probabilistic threshold approach," in SIGMOD, 2008.
19. I. F. Ilyas, W. G. Aref, A. K. Elmagarmid, H. Elmongui, R. Shah, and J. S. Vitter, "Adaptive rank-aware query optimization in relational databases," TODS, vol. 31, 2006.
20. I. F. Ilyas, G. Beskales, and M. A. Soliman, "Survey of top-k query processing techniques in relational database systems," ACM Computing Surveys, 2008.
21. R. Jampani, F. Xu, M. Wu, L. L. Perez, C. M. Jermaine, and P. J. Haas, "MCDB: a monte carlo approach to managing uncertain data," in SIGMOD, 2008.
22. B. Kanagal and A. Deshpande, "Online filtering, smoothing and probabilistic modeling of streaming data," in ICDE, 2008.
23. C. Li, K. C.-C. Chang, I. Ilyas, and S. Song, "RankSQL: Query algebra and optimization for relational top-k queries," in SIGMOD, 2005.
24. X. Lian and L. Chen, "Probabilistic ranked queries in uncertain databases," in EDBT, 2008.
25. V. Ljosa and A. Singh, "APLA: Indexing arbitrary probability distributions," in ICDE, 2007.
26. V. Ljosa and A. K. Singh, "Top-k spatial joins of probabilistic objects," in ICDE, 2008.
27. J. Pei, B. Jiang, X. Lin, and Y. Yuan, "Probabilistic skylines on uncertain data," in VLDB, 2007.
28. C. Re, N. Dalvi, and D. Suciu, "Efficient top-k query evaluation on probabilistic databases," in ICDE, 2007.
29. A. D. Sarma, O. Benjelloun, A. Halevy, and J. Widom, "Working models for uncertain data," in ICDE, 2006.
30. P. Sen and A. Deshpande, "Representing and querying correlated tuples in probabilistic databases," in ICDE, 2007.
31. J. G. Shanthikumar and M. Shaked, Stochastic Orders and Their Applications. Academic Press, 1994.
32. S. Singh, C. Mayfield, S. Prabhakar, R. Shah, and S. Hambrusch, "Indexing uncertain categorical data," in ICDE, 2007.
33. M. A. Soliman, I. F. Ilyas, and K. C.-C. Chang, "Top-k query processing in uncertain databases," in ICDE, 2007.
34. M. A. Soliman, I. F. Ilyas, and K. C.-C. Chang, "Probabilistic top-k and ranking-aggregate queries," TODS, vol. 33, no. 3, 2008.
35. Y. Tao, R. Cheng, X. Xiao, W. K. Ngai, B. Kao, and S. Prabhakar, "Indexing multi-dimensional uncertain data with arbitrary probability density functions," in VLDB, 2005.
36. D. Xin, J. Han, and K. C.-C. Chang, "Progressive and selective merge: Computing top-k with ad-hoc ranking functions," in SIGMOD, 2007.
37. K. Yi, F. Li, D. Srivastava, and G. Kollios, "Efficient processing of top-k queries in uncertain databases with x-relations," IEEE TKDE, vol. 20, no. 12, pp. 1669-1682, 2008.
38. Q. Zhang, F. Li, and K. Yi, "Finding frequent items in probabilistic data," in SIGMOD, 2008.
39. X. Zhang and J. Chomicki, "On the semantics and evaluation of top-k queries in probabilistic databases," in DBRank, 2008.