Efficient algorithms for reverse proximity query problems

GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems

Volumn , Issue , 2008, Pages 347-356

  Kumar, Yokesh ^a   Janardan, Ravi ^a   Gupta, Prosenjit ^b  

^a UNIVERSITY OF MINNESOTA   (United States)

^b INTERNATIONAL INSTITUTE OF INFORMATION TECHNOLOGY   (India)

Author keywords

Approximation; Query processing; Reverse proximity

Indexed keywords

APPROXIMATION; CONVEX POLYTOPES; D-SPACE; EFFICIENT ALGORITHM; ERROR PARAMETERS; EUCLIDEAN; GENERAL APPROACH; GEOMETRIC TRANSFORMATIONS; GIS APPLICATION; HIGHER ORDER; K-NEAREST NEIGHBORS; NEAREST NEIGHBORS; PROXIMITY QUERIES; QUERY POINTS; REVERSE NEAREST NEIGHBORS; THREE DIMENSIONS;

GEOGRAPHIC INFORMATION SYSTEMS; INFORMATION SYSTEMS; QUERY PROCESSING; SERVERS; TOPOLOGY;

APPROXIMATION ALGORITHMS;

EID: 70449719455     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1463434.1463483     Document Type: Conference Paper

References (19)

1. 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. ACM SIGMOD Conf., pages 515-526, 2006.
2. P. Agarwal and J. Erickson. Geometric range searching and its relatives. In J. E. Goodman B. Chazelle and R. Pollack, editors, Adv. in Disc. and Comp. Geom., pages 1-56. AMS Press, 1998.
3. A. Aggarwal, M. Hansen, and T. Leighton. Solving query-retrieval problems by compacting Voronoi diagrams. In Proc. ACM STOC, pages 331-340, 1990.
4. R. Anderson and B. Tjaden. The inverse nearest neighbor problem with astrophysical applications. In Proc. ACM-SIAM SODA Symp., pages 767-768, 2001.
5. R. Benetis, C. Jensen, G. Karciauskas, and S. Saltenis. Nearest neighbor and reverse nearest neighbor queries for moving objects. VLDB Jour., pages 229-249, 2006.
6. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational geometry: algorithms and applications. Springer-Verlag, 2000.
7. H. Edelsbrunner. Algorithms in combinatorial geometry. Springer-Verlag, 1987.
8. J. Kang, M. Mokbel, S. Shekhar, T. Xia, and D. Zhang. Continuous evaluation of monochromatic and bichromatic reverse nearest neighbors. In Proc. IEEE ICDE Conf., pages 806-815, 2007.
9. F. Korn and S. Muthukrishnan. Influence sets based on reverse nearest neighbor queries. In Proc. ACM SIGMOD Conf., pages 201-212, 2000.
10. F. Korn, S. Muthukrishnan, and D. Srivastava. Reverse nearest neighbor aggregates over data streams. In Proc. VLDB Conf., pages 814-825, 2002.
11. A. Maheshwari, J. Vahrenhold, and N. Zeh. On reverse nearest neighbor queries. In Proc. Canadian Conf. Comput. Geom., 2002.
12. 2P: Clustering based on closest pairs. In Proc. VLDB Conf., pages 331-340, 2001.
13. A. Singh, H. Ferhatosmanoglu, and A. Tosun. High dimensional reverse nearest neighbor queries. In Proc. ACM CIKM Conf., pages 91-98, 2003.
14. I. Stanoi, D. Agrawal, and A. El Abbadi. Reverse nearest neighbor queries for dynamic databases. In SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pages 44-53, 2000.
15. Y. Tao, M.Yiu, and N. Mamoulis. Reverse nearest neighbor search in metric spaces. IEEE TKDE, 18(9):1239-1252, 2006.
16. Y. Tao, D. Papadias, and X. Lian. Reverse kNN search in arbitrary dimensionality. In Proc. VLDB Conf., pages 744-755, 2004.
17. E. Weisstein. Platonic solid. In MathWorld. mathworld.wolfram.com/ PlatonicSolid.html.
18. C. Yang and K-I. Lin. An index structure for efficient reverse nearest neighbor queries. In Proc. IEEE ICDE Conf., pages 485-492, 2001.
19. M. Yiu, D. Papadias, N. Mamoulis, and Y. Tao. Reverse nearest neighbors in large graphs. IEEE TKDE, 18(4):540-553, 2006.