Efficient reverse k-nearest neighbor search in arbitrary metric spaces

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2006, Pages 515-526

  Achtert, Elke ^a   Böhm, Christian ^a   Kröger, Peer ^a   Kunath, Peter ^a   Pryakhin, Alexey ^a   Renz, Matthias ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

Metric index structure; Reverse nearest neighbor search

Indexed keywords

DATA STORAGE EQUIPMENT; DATABASE SYSTEMS; PARAMETER ESTIMATION; SCALABILITY; USABILITY ENGINEERING;

METRIC DISTANCE FUNCTION; METRIC INDEX STRUCTURE; REVERSE K-NEAREST NEIGHBOR (RKNN) PROBLEM;

QUERY PROCESSING;

EID: 34250624528     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1142473.1142531     Document Type: Conference Paper

References (12)

1. A. M. Andrew. Another efficient algorithm for convex hulls in two dimensions. Information Processing Letters, 9, 1979.
2. 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, 1990.
3. S. Berchtold, D. A. Keim, and H.-P. Kriegel. The X-Tree: An index structure for high-dimensional data. In Proc. VLDB, 1996.
4. P. Ciaccia, M. Patella, and P. Zezula. M-Tree: an efficient access method for similarity search in metric spaces. In Proc. VLDB, 1997.
5. C. Ding and H. Peng. Minimum redundancy feature selection from microarray gene expression data. In CSB03, 2003.
6. A. Guttman. R-Trees: A dynamic index structure for spatial searching. In Proc. SIGMOD, 1984.
7. F. Korn and S. Muthukrishnan. Influenced sets based on reverse nearest neighbor queries. In Proc. SIGMOD, 2000.
8. M. Schroeder. Fractals, Chaos, Power Laws: Minutes from an infinite paradise. W.H. Freeman and company, New York, 1991.
9. A. Singh, H. Ferhatosmanoglu, and A. S. Tosun. High dimensional reverse nearest neighbor queries. In Proc. CIKM, 2003.
10. I. Stanoi, D. Agrawal, and A. E. Abbadi. Reverse nearest neighbor queries for dynamic databases. In Proc. DMKD, 2000.
11. Y. Tao, D. Papadias, and X. Lian. Reverse kNN search in arbitrary dimensionality. In Proc. VLDB, 2004.
12. C. Yang and K.-I. Lin. An index structure for efficient reverse nearest neighbor queries. In Proc. ICDE, 2001.