High dimensional reverse nearest neighbor queries

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2003, Pages 91-98

  Singh, Amit ^a   Ferhatosmanog̊lu, Hakan ^a   Tosun, Ali Şaman ^b  

^a OHIO STATE UNIVERSITY   (United States)

^b University of Texas at San Antonio   (United States)

Author keywords

Boolean Range Query; Nearest Neighbor; Reverse Nearest Neighbor

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOOLEAN ALGEBRA; CORRELATION THEORY; DATA REDUCTION; DATABASE SYSTEMS; INFORMATION RETRIEVAL;

BOOLEAN RANGE QUERY (BRQ); MATCHING QUERY; NEAREST NEIGHBOR; REVERSE NEAREST NEIGHBOR (RNN);

QUERY LANGUAGES;

EID: 18744363040     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/956863.956882     Document Type: Conference Paper

References (23)

1. http://gist.cs.berkeley.edu.
2. J. V. Anil Maheshwari and N. Zeh. On reverse nearest neighbor queries. In Proceedings of the 14th Canadian Conference on Computational Geometry, University of Lethbridge, Alberta, Canada, Aug 2002.
3. N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The R* tree: An efficient and robust access method for points and rectangles. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 322-331, May 23-25 1990.
4. B. Braunmuller, M. Ester, H. Kriegel, and J. Sander. Efficiently supporting multiple similarity queries for mining in metric databases. In Proc of 16th IEEE Int. Conf. on Data Engineering (ICDE), San Diego, CA, March 2000.
5. K. Chakrabarti and S. Mehrotra. The hybrid tree: An index structure for high dimensional feature spaces. In Proc. Int. Conf. Data Engineering, pages 440-447, Sydney, Australia, 1999.
6. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In Proceedings of the Int. Conf. on Very Large Data Bases, Athens, Greece, August 1997.
7. J. Conway and N. Sloane. Sphere packings, Lattices and Groups. Springer-Verlag, 1988.
8. V. Gaede and O. Gunther. Multidimensional access methods. ACM Computing Surveys, 30:170-231, 1998.
9. A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 47-57, 1984.
10. G. R. Hjaltason and H. Samet. Ranking in spatial databases. In Proc. of 4th Int. Symp. on Large Spatial Databases, pages 83-95, Portland,ME, 1995.
11. K. V. R. Kanth, D. Agrawal, and A. Singh. Dimensionality reduction for similarity searching in dynamic databases. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 166-176, Seattle, Washington, June 1998.
12. F. Korn and S. Muthukrishnan. Influence sets based on reverse nearest neighbor queries. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, 2000, Dallas, Texas, USA, May 2000.
13. F. Korn, S. Muthukrishnan, and D. Srivastava. Reverse nearest neighbor aggregates over data streams. In Proceedings of the Int. Conf. on Very Large Data Bases, Hong Kong, China, Aug. 2002.
14. C. Lang and A. Singh. Accelerating high-dimensional nearest neighbor queries. In SSDBM, Edinburgh, Scotland, July 2002.
15. D. B. Lomet and B. Salzberg. The hb-tree: A multi-attribute indexing method with good guaranteed performance. A CM Transactions on Database Systems, 15(4):625-658, December 1990.
16. J. Nievergelt, H. Hinterberger, and K.C.Sevcik. The grid file: an adaptable, symmetric multikey file structure. ACM Transactions on Database Systems 9, 1:38-71, Mar. 1984.
17. J. T. Robinson. The kdb-tree: A search structure for large multi-dimensional dynamic indexes. In Proc. A CM SIGMOD Int. Conf. on Management of Data, pages 10-18, 1981.
18. N. Roussopoulos, S. Kelly, and F. Vincent. Nearest neighbor queries. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 71-79, San Jose, California, May 1995.
19. T. Seidl and H. Kriegel. Optimal multi-step k-nearest neighbor search. In Proc. ACM SIGMOD Int. Conf. on Management of Data, Chicago, Illinois, U.S.A., June 1998. ACM.
20. I. Stanoi, D. Agrawal, and A. El Abbadi. Reverse nearest neighbor queries for dynamic databases. In ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD 2000) in conjunction with SIGMOD 2000, Dallas, USA, 2000.
21. I. Stanoi, M. Riedewald, D. Agrawal, and A. El Abbadi. Discovery of influence sets in frequently updated databases. In Proceedings of the 27th International Conference on Very Large Databases, Rome, Italy, 2001.
22. R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proceedings of the Int. Conf. on Very Large Data Bases, pages 194-205, New York City, New York, Aug. 1998.
23. C. Yang and K.-I. Lin. An index structure for efficient reverse nearest neighbor queries. In Proceedings of the 17th International Conference on Data Engineering Databases, Heidelberg, Germany, 2001.