Ranking with uncertain scores

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 317-328

  Soliman, Mohamed A ^a   Ilyas, Ihab F ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE QUERY; DATA INTEGRATION; EFFICIENT QUERY EVALUATION; EXPERIMENTAL EVALUATION; EXPERIMENTAL STUDIES; LARGE DATABASE; LOCATION TRACKING; PARTIAL ORDER; PROBABILISTIC MODELS; RANK AGGREGATION; RANKING QUERIES; SAMPLING TECHNIQUE; SYNTHETIC DATA; TOTAL ORDER; UNCERTAIN INFORMATIONS; WEB SEARCHES;

DATA HANDLING;

WORLD WIDE WEB;

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

References (26)

1. A. D. Sarma, O. Benjelloun, A. Halevy, and J. Widom, "Working models for uncertain data," in ICDE, 2006.
2. O. Benjelloun, A. D. Sarma, A. Halevy, and J. Widom, "Uldbs: Databases with uncertainty and lineage," in VLDB, 2006.
3. D. S. Nilesh N. Dalvi, "Efficient query evaluation on probabilisticdatabases," in VLDB, 2004.
4. K. C.-C. Chang and S. won Hwang, "Minimal probing: supporting expensive predicates for top-k queries," in SIGMOD, 2002.
5. I. F. Ilyas, G. Beskales, and M. A. Soliman, "A survey of top-k query processing techniques in relational database systems," ACM Comput. Surv., vol. 40, no. 4, 2008.
6. G. Wolf, H. Khatri, B. Chokshi, J. Fan, Y. Chen, and S. Kambhampati, "Query processing over incomplete autonomous databases," in VLDB, 2007.
7. X. Wu and D. Barbara", "Learning missing values from summary constraints," SIGKDD Explorations, vol. 4, no. 1, 2002.
8. J. Chomicki, "Preference formulas in relational queries," ACM Trans. Database Syst., vol. 28, no. 4, 2003.
9. C.-Y. Chan, H. V. Jagadish, K.-L. Tan, A. K. H. Tung, and Z. Zhang, "Finding k-dominant skylines in high dimensional space," in SIGMOD, 2006.
10. Y. Tao, X. Xiao, and J. Pei, "Efficient skyline and top-k retrieval in subspaces," TKDE, vol. 19, no. 8, 2007.
11. G. Brightwell and P. Winkler, "Counting linear extensions is #pcomplete," in STOC, 1991.
12. R. Cheng, S. Prabhakar, and D. V. Kalashnikov, "Querying imprecise data in moving object environments," in ICDE, 2003.
13. A. Deshpande, C. Guestrin, S. Madden, J. M. Hellerstein, and W. Hong, "Model-based approximate querying in sensor networks," VLDB J., vol. 14, no. 4, 2005.
14. S. Abiteboul, P. Kanellakis, and G. Grahne, "On the representation and querying of sets of possible worlds," in SIGMOD, 1987.
15. M. A. Soliman, I. F. Ilyas, and K. C.-C. Chang, "Top-k query processing in uncertain databases," in ICDE, 2007.
16. X. Zhang and J. Chomicki, "On the semantics and evaluation of top-k queries in probabilistic databases," in ICDE Workshops, 2008.
17. M. Hua, J. Pei, W. Zhang, and X. Lin, "Ranking queries on uncertain data: a probabilistic threshold approach," in SIGMOD, 2008.
18. D. P. O'Leary, "Multidimensional integration: Partition and conquer," Computing in Science and Engineering, vol. 6, no. 6, 2004.
19. M. Jerrum and A. Sinclair, "The markov chain monte carlo method: an approach to approximate counting and integration," 1997.
20. W. K. Hastings, "Monte carlo sampling methods using markov chains and their applications," Biometrika, vol. 57, no. 1, 1970.
21. A. Gelman and D. B. Rubin, "Inference from iterative simulation using multiple sequences," Statistical Science, vol. 7, no. 4, 1992.
22. M. K. Cowles and B. P. Carlin, "Markov chain Monte Carlo convergence diagnostics: A comparative review," Journal of the American Statistical Association, vol. 91, no. 434, 1996.
23. C. Dwork, R. Kumar, M. Naor, and D. Sivakumar, "Rank aggregation methods for the web," in WWW, 2001.
24. R. Bubley and M. Dyer, "Faster random generation of linear extensions," in SODA, 1998.
25. C. Re, N. Dalvi, and D. Suciu, "Efficient top-k query evaluation on probabilistic data," in ICDE, 2007.
26. M. Wu and C. Jermaine, "A bayesian method for guessing the extreme values in a data set," in VLDB, 2007.