A novel probabilistic pruning approach to speed up similarity queries in uncertain databases

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2011, Pages 339-350

  Bernecker, Thomas ^a   Emrich, Tobias ^a   Kriegel, Hans Peter ^a   Mamoulis, Nikos ^b   Renz, Matthias ^a   Züfle, Andreas ^a  

^a UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

EXPERIMENTAL EVALUATION; MULTI-DIMENSIONAL SPACE; POSSIBLE WORLD SEMANTICS; PROBABILISTIC DENSITY FUNCTION; PROBABILITY BOUND; REFERENCE OBJECTS; SIMILARITY QUERY; SPEED-UPS; UNCERTAIN DATABASE; UNCERTAIN DATAS; UNCERTAINTY MODELS;

PROBABILITY DENSITY FUNCTION; QUERY PROCESSING; RANDOM VARIABLES; SEMANTICS;

QUERY LANGUAGES;

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

References (27)

1. L. Antova, T. Jansen, C. Koch, and D. Olteanu. Fast and simple relational processing of uncertain data. In Proc. ICDE, 2008.
2. J. L. Bentley. Multidimensional binary search trees used for associative searching. Commun. ACM, 18(9):509-517, 1975.
3. T. Bernecker, T. Emrich, H.-P. Kriegel, N. Mamoulis, M. Renz, and A. Z̈ufle. A novel probabilistic pruning approach to speed up similarity queries in uncertain databases. http://www.dbs.ifi.lmu.de/ Publikationen/Papers/ ICDE2010-TR.pdf. Technical report.
4. T. Bernecker, H.-P. Kriegel, and M. Renz. Proud: Probabilistic ranking in uncertain databases. In Proc. SSDBM, pages 558-565, 2008.
5. T. Bernecker, H.-P. Kriegel, M. Renz, F. Verhein, and A. Z̈ufle. Probabilistic frequent itemset mining in uncertain databases. In Proc. KDD, pages 119-128, 2009.
6. G. Beskales, M. A. Soliman, and I. F. IIyas. Efficient search for the top-k probable nearest neighbors in uncertain databases. Proc. VLDB Endow., 1(1):326-339, 2008.
7. M. A. Cheema, X. Lin, W. Wang, W. Zhang, and J. Pei. Probabilistic reverse nearest neighbor queries on uncertain data. IEEE Trans. Knowl. Data Eng., 22(4):550-564, 2010.
8. J. Chen and R. Cheng. Efficient evaluation of imprecise locationdependent queries. In Proc. ICDE, 2007.
9. R. Cheng, J. Chen, M. Mokbel, and C. Chow. Probabilistic verifiers: Evaluating constrained nearest-neighbor queries over uncertain data. In Proc. ICDE, 2008.
10. R. Cheng, L. Chen, J. Chen, and X. Xie. Evaluating probability threshold k-nearest-neighbor queries over uncertain data. In EDBT, pages 672-683, 2009.
11. R. Cheng, D. Kalashnikov, and S. Prabhakar. Querying imprecise data in moving object environments. In IEEE TKDE, 2004.
12. R. Cheng, S. Singh, and S. Prabhakar. U-dbms: a database system for managing constantly-evolving data. In Proc. VLDB, 2005.
13. R. Cheng, Y. Xia, S. Prabhakar, R. Shah, and J. Vitter. Efficient indexing methods for probabilistic threshold queries over uncertain data. In Proc. VLDB, pages 876-887, 2004.
14. G. Cormode, F. Li, and K. Yi. Semantics of ranking queries for probabilistic data and expected results. In Proc. ICDE, 2009.
15. T. Emrich, H.-P. Kriegel, P. Kr̈oger, M. Renz, and A. Z̈ufle. Boosting spatial pruning: On optimal pruning of mbrs. In Proc. SIGMOD, 2010.
16. M. Hua, J. Pei, W. Zhang, and X. Lin. Ranking queries on uncertain data: a probabilistic threshold approach. In Proc. SIGMOD, 2008.
17. Y. Iijima and Y. Ishikawa. Finding probabilistic nearest neighbors for query objects with imprecise locations. In Proc. MDM, 2009.
18. H.-P. Kriegel, P. Kunath, and M. Renz. Probabilistic nearest-neighbor query on uncertain objects. In DASFAA, pages 337-348, 2007.
19. J. Li, B. Saha, and A. Deshpande. A unified approach to ranking in probabilistic databases. PVLDB, 2(1):502-513, 2009.
20. X. Lian and L. Chen. Efficient processing of probabilistic reverse nearest neighbor queries over uncertain data. VLDB J., 18(3):787-808, 2009.
21. X. Lian and L. Chen. Probabilistic inverse ranking queries over uncertain data. In Proc. DASFAA, pages 35-50, 2009.
22. V. Ljosa and A. K. Singh. Apla: Indexing arbitrary probability distributions. In ICDE, pages 946-955, 2007. (Pubitemid 47422098)
23. P. Sen and A. Deshpande. Representing and querying correlated tuples in probabilistic databases. In Proc. ICDE, 2007.
24. S. Singh, C. Mayfield, S. Mittal, S. Prabhakar, S. E. Hambrusch, and R. Shah. Orion 2.0: native support for uncertain data. In Proc. SIGMOD, pages 1239-1242, 2008.
25. M. Soliman and I. Ilyas. Ranking with uncertain scores. In Proc. ICDE, pages 317-328, 2009.
26. 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 Proc. VLDB, 2005.
27. O. Wolfson, A. P. Sistla, S. Chamberlain, and Y. Yesha. Updating and querying databases that track mobile units. Distributed and Parallel Databases, 7(3):257-387, 1999.