Efficient probabilistic reverse nearest neighbor query processing on uncertain data

Proceedings of the VLDB Endowment

Volumn 4, Issue 10, 2011, Pages 669-680

  Bernecker, Thomas ^a   Emrich, Tobias ^a   Kriegel, Hans Peter ^a   Renz, Matthias ^a   Zankl, Stefan ^a   Züfle, Andreas ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA HANDLING; NEAREST NEIGHBOR SEARCH;

EXPERIMENTAL EVALUATION; HIGH PROBABILITY; NEAREST NEIGHBORS; QUERY OBJECT; REVERSE NEAREST NEIGHBOR QUERIES; REVERSE NEAREST NEIGHBORS; UNCERTAIN DATAS;

QUERY PROCESSING;

EID: 84863492712     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2021017.2021024     Document Type: Article

References (26)

1. S. Abiteboul, P. C. Kanellakis, and G. Grahne. On the representation and querying of sets of possible worlds. In Proc. SIGMOD, pages 34-48, 1987.
2. P. Agrawal, O. Benjelloun, A. D. Sarma, C. Hayworth, S. U. Nabar, T. Sugihara, and J. Widom. Trio: A system for data, uncertainty, and lineage. In Proc. VLDB, pages 1151-1154, 2006.
3. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-Tree: An efficient and robust access method for points and rectangles. In Proc. SIGMOD, pages 322-331, 1990.
4. J. L. Bentley. Multidimensional binary search trees used for associative searching. Commun. ACM, 18(9):509-517, 1975.
5. T. Bernecker, T. Emrich, H.-P. Kriegel, N. Mamoulis, M. Renz, and A. Züfle. A novel probabilistic pruning approach to speed up similarity queries in uncertain databases. In Proc. ICDE, pages 339-350, 2011.
6. T. Bernecker, H.-P. Kriegel, N. Mamoulis, M. Renz, and A. Zuefle. Scalable probabilistic similarity ranking in uncertain databases. IEEE Transactions on Knowledge and Data Engineering, 22:1234-1246, 2010.
7. G. Beskales, M. A. Soliman, and I. F. Ilyas. Efficient search for the top-k probable nearest neighbors in uncertain databases. Proc. VLDB Endow., 1(1):326-339, 2008.
8. G. Chapman, J. Cleese, T. Gilliam, E. Idle, T. Jones, and M. Palin. Monty python's the life of brian, 1979.
9. 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.
10. J. Chen and R. Cheng. Efficient evaluation of imprecise location-dependent queries. In Proc. ICDE, pages 586-595, 2007.
11. R. Cheng, J. Chen, M. Mokbel, and C. Chow. Probabilistic verifiers: Evaluating constrained nearest-neighbor queries over uncertain data. In Proc. ICDE, pages 973-982, 2008.
12. R. Cheng, D. Kalashnikov, and S. Prabhakar. Querying imprecise data in moving object environments. In IEEE TKDE, pages 1112-1127, 2004.
13. G. Cormode, F. Li, and K. Yi. Semantics of ranking queries for probabilistic data and expected results. In Proc. ICDE, pages 305-316, 2009.
14. T. Emrich, H.-P. Kriegel, P. Kröger, M. Renz, and A. Züfle. Boosting spatial pruning: On optimal pruning of mbrs. In Proc. SIGMOD, pages 39-50, 2010.
15. A. Guttman. R-Trees: A dynamic index structure for spatial searching. In Proc. SIGMOD, pages 47-57, 1984.
16. F. Korn and S. Muthukrishnan. Influence sets based on reverse nearest neighbor queries. In Proc. SIGMOD, pages 201-212, 2000.
17. J. Li and A. Deshpande. Consensus answers for queries over probabilistic databases. In PODS, pages 259-268, 2009.
18. J. Li and A. Deshpande. Ranking continuous probabilistic datasets. In Proc. VLDB, pages 638-649, 2010.
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. J. Pei, B. Jiang, X. Lin, and Y. Yuan. Probabilistic skylines on uncertain data. In Proceedings of the 33rd International Conference on Very Large Data Bases, University of Vienna, Austria, September 23-27, 2007, pages 15-26, 2007.
23. 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.
24. M. A. Soliman, I. F. Ilyas, and K. C.-C. Chang. Top-k query processing in uncertain databases. In Proc. ICDE, pages 896-905, 2007.
25. I. Stanoi, D. Agrawal, and A. E. Abbadi. Reverse nearest neighbor queries for dynamic databases. In Proc. DMKD, pages 44-53, 2000.
26. Y. Tao, D. Papadias, and X. Lian. Reverse kNN search in arbitrary dimensionality. In Proc. VLDB, pages 744-755, 2004.