Efficient rank based KNN query processing over uncertain data

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2010, Pages 28-39

  Zhang, Ying ^a   Lin, Xuemin ^a   Zhu, Gaoping ^a   Zhang, Wenjie ^a   Lin, Qianlu ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENT ALGORITHM; ENVIRONMENTAL SURVEILLANCE; K-NN QUERY; RANDOMIZED ALGORITHMS; RANKING METHODS; SYNTHETIC DATA; UNCERTAIN DATAS;

ALGORITHMS;

DATA PROCESSING;

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

References (35)

1. A. P. Sistla, O. Wolfson, S. Chamberlain, and S. Dao, "Querying the uncertain position of moving objects," in Temporal Databases, 1997.
2. A. Deshpande, C. Guestrin, S. Madden, J. M. Hellerstein, and W. Hong, "Model-driven data acquisition in sensor networks," in VLDB, 2004.
3. A. D. Sarma, O. Benjelloun, A. Halevy, and J. Widom, "Working models for uncertain data." in ICDE, 2005.
4. J. Pei, M. Hua, Y. Tao, and X. Lin, "Mining uncertain and probabilistic data: problems, challenges, methods, and applications," in KDD, 2008.
5. G. Beskales, M. A. Soliman, and I. F. Ilyas, "Efficient search for the top-k probable nearest neighbors in uncertain databases," PVLDB, vol. 1, no. 1, 2008.
6. H.-P. Kriegel, P. Kunath, and M. Renz, "Probabilistic nearest-neighbor query on uncertain objects," in DASFAA, 2007, pp. 337-348.
7. R. Cheng, J. Chen, M. F. Mokbel, and C.-Y. Chow, "Probabilistic verifiers: Evaluating constrained nearest-neighbor queries over uncertain data," in ICDE, 2008.
8. M. A. Soliman, I. F. Ilyas, and K. C. Chang., "Top-k query processing in uncertain databases." in ICDE 2007.
9. V. Ljosa and A. K. Singh, "Apla: Indexing arbitrary probability distributions," in ICDE, 2007.
10. R. Cheng, L. Chen, J. Chen, and X. Xie, "Evaluating probability threshold k-nearest-neighbor queries over uncertain data," in EDBT, 2009.
11. G. Cormode, F. Li, and K. Yi, "Semantics of ranking queries for probabilistic data and expected ranks," in ICDE, 2009.
12. C. Re, N. N. Dalvi, and D. Suciu, "Efficient top-k query evaluation on probabilistic data," in ICDE, 2007.
13. 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.
14. M. A. Soliman and I. F. Ilyas, "Ranking with uncertain scores," in ICDE, 2009.
15. S. Khanna and W. C. Tan, "On computing functions with uncertainty," in PODS, 2001.
16. T. Feder, R. Motwani, R. Panigrahy, C. Olston, and J. Widom, "Computing the median with uncertainty," in STOC, 2000.
17. X. Zhang and J. Chomicki, "On the semantics and evaluation of top-k queries in probabilistic databases," in DBRank, 2008.
18. J. G. Shanthikumar and M. Shaked, Stochastic Orders and Their Applications. Academic Press, 1997.
19. A. M. Gibbons, Algorithmic Graph Theory, 1980.
20. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms (second edition), 2001.
21. M. L. Yiu, N. Mamoulis, and Y. Tao, "Efficient quantile retrieval on multi-dimensional data," in EDBT, 2006.
22. G. S. Manku, S. Rajagopalan, and B. G. Lindsay, "Approximate medians and other quantiles in one pass and with limited memory," in SIGMOD, 1998.
23. G. R. Hjaltason and H. Samet, "Distance browsing in spatial databases." TODS, vol. 24, no. 2, pp. 265-318, 1999.
24. Y. Theodoridis and T. K. Sellis, "A model for the prediction of r-tree performance," in PODS, 1996.
25. W. Gilks, S. Richardson, and D. Spiegelhalter, Markov chain Monte Carlo in practice. Chapman & Hall, 1996.
26. W. Hoeffding, "Probability inequalities for sums of bounded random variables," JASA 1963.
27. N. N. Dalvi and D. Suciu, "Efficient query evaluation on probabilistic databases," in VLDB, 2004, pp. 864-875.
28. O. Benjelloun, A. D. Sarma, A. Y. Halevy, and J. Widom, "Uldbs: Databases with uncertainty and lineage," in VLDB, 2006.
29. L. Antova, C. Koch, and D. Olteanu, "Query language support for incomplete information in the maybms system," in VLDB, 2007.
30. S. Singh, C. Mayfield, S. Mittal, S. Prabhakar, S. E. Hambrusch, and R. Shah, "Orion 2.0: native support for uncertain data," in SIGMOD Conference, 2008.
31. M. Hua, J. Pei, W. Zhang, and X. Lin, "Ranking queries on uncertain data: A probabilistic threshold approach." in SIGMOD, 2008.
32. T. Ge, S. Zdonik, and S. Madden, "Top-k queries on uncertain data: On score distribution and typical answers," in SIGMOD, 2009.
33. R. Cheng, D. V. Kalashnikov, and S. Prabhakar, "Evaluating probabilistic queries over imprecise data," in SIGMOD Conference, 2003.
34. R. Cheng, D. Kalashnikov, and S. Prabhakar, "Querying imprecise data in moving object environments," TKDE, vol. 16, no. 9, 2004.
35. X. Lian and L. Chen, "Probabilistic group nearest neighbor queries in uncertain databases," TKDE, vol. 20, no. 6, 2008.