Reverse k-nearest neighbor search in dynamic and general metric databases

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, EDBT'09

Volumn , Issue , 2009, Pages 886-897

  Achtert, Elke ^a   Kriegel, Hans Peter ^a   Kröger, Peer ^a   Renz, Matthias ^a   Züfle, Andreas ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY VALUES; DATA OBJECTS; DYNAMIC ENVIRONMENTS; EUCLIDEAN; EXISTING METHOD; GENERAL SOLUTIONS; INDEX STRUCTURE; K NEAREST NEIGHBOR SEARCH; K-NEAREST NEIGHBORS; METRIC DATABASE; METRIC DISTANCES; QUERY EXECUTION; SEARCH PROBLEM;

DECISION TREES;

DATABASE SYSTEMS;

EID: 70349127600     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1516360.1516462     Document Type: Conference Paper

References (15)

1. E. Achtert, C. Böhm, P. Kröger, P. Kunath, A. Pryakhin, and M. Renz. Approximate reverse k-nearest neighbor search in general metric spaces. In Proc. CIKM, 2006.
2. E. Achtert, C. Böhm, P. Kröger, P. Kunath, A. Pryakhin, and M. Renz. Efficient reverse k-nearest neighbor search in arbitrary metric spaces. In Proc. SIGMOD, 2006.
3. E. Achtert, C. Böhm, P. Kröger, P. Kunath, A. Pryakhin, and M. Renz. Efficient reverse k-nearest neighbor estimation. In Proc. BTW, 2007.
4. *-Tree: An efficient and robust access method for points and rectangles. In Proc. SIGMOD, pages 322-331, 1990.
5. P. Ciaccia, M. Patella, and P. Zezula. M-Tree: an efficient access method for similarity search in metric spaces. In Proc. VLDB, 1997.
6. A. Guttman. R-Trees: A dynamic index structure for spatial searching. In Proc. SIGMOD, pages 47-57, 1984.
7. F. Korn and S. Muthukrishnan. Influenced sets based on reverse nearest neighbor queries. In Proc. SIGMOD, 2000.
8. I. Lazaridis and S. Mehrotra. Progressive approximate aggregate queries with a multi-resolution tree structure. In Proc. SIGMOD, 2001.
9. D. Papadias, P. Kalnis, J. Zhang, and Y. Tao. Efficient olap operations in spatial data warehouses. In Proc. SSTD, 2001.
10. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In SIGMOD '95: Proceedings of the 1995 ACM SIGMOD international conference on Management of data, San Jose, California, United States, pages 71-79, 1995.
11. A. Singh, H. Ferhatosmanoglu, and A. S. Tosun. High dimensional reverse nearest neighbor queries. In Proc. CIKM, 2003.
12. I. Stanoi, D. Agrawal, and A. E. Abbadi. Reverse nearest neighbor queries for dynamic databases. In Proc. DMKD, 2000.
13. Y. Tao, D. Papadias, and X. Lian. Reverse kNN search in arbitrary dimensionality. In Proc. VLDB, 2004.
14. Y. Tao, M. L. Yiu, and N. Mamoulis. Reverse nearest neighbor search in metric spaces. IEEE TKDE, 18(9):1239-1252, 2006.
15. C. Yang and K.-I. Lin. An index structure for efficient reverse nearest neighbor queries. In Proc. ICDE, 2001.