Exploiting a page-level upper bound for multi-type nearest neighbor queries

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

Volumn , Issue , 2006, Pages 179-186

  Ma, Xiaobin ^a   Shekhar, Shashi ^a   Xiong, Hui ^b   Zhang, Pusheng ^c  

^a UNIVERSITY OF MINNESOTA   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c MICROSOFT   (United States)

Author keywords

GIS; Location based service; MTNN query

Indexed keywords

GAS STATIONS; GROCERY STORE; LOCATION-BASED SERVICES; MTNN QUERY; PERFORMANCE TUNING;

CLUSTER ANALYSIS; HOTELS; NETWORK ROUTING; POST OFFICES; PROBLEM SOLVING; SHOPPING CENTERS;

QUERY LANGUAGES;

EID: 34547434209     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1183471.1183501     Document Type: Conference Paper

References (25)

1. S. Berchtold, C. Bohm, D. Keim, and H. Kriegel. A Cost Model for Nearest Neighbor in High-Dimensional Data, Space. In PODS, pages 78-86, 1997.
2. K. Cheung and A. Fu. Enhanced Nearest Neighbor Search on the R-tree. A CM SIGMOD Record, pages 16-21, 1998.
3. K. Clarkson. Fast Algorithms for the All-Nearest-Neighbors Problem. In FOCS, 1983.
4. J. G. Cleary. Analysis of an algorithm for finding nearest neighbor in Euclidean space. ACM Transactions on Mathematical Software, pages 183-192, June 1979.
5. A. Corral, Y. Manolopoulos, and M. Vassilakopoulos. Closest Pair Queries in Spatial Databases. In ACM SIGMOD, 2000.
6. A. Corral, Y. Manolopoulos, and M. Vassilakopoulos. Algorithms for Processing K-closest-pair Queries in Spatial Databases. Data and Knowledge Engineering, pages 67-104, 2004.
7. A. Corral, M. Vassilakopoulos, and Y. Manolopoulos. The impact of Buffering on Closest Pairs Queries Using R-Trees. In ADBIS'01, pages 41-54, 2001.
8. C.Yang and K.-I. Lin. A index structure for efficient reverse nearest neighbor queries. In ICDE, 2001.
9. J. H. Friedman, J. L. Bentley, and R. A. Finkel. An algorithm for finding best matches in logrithmic expected time. ACM Transactions on Mathematical Software, pages 209-226, September 1977.
10. H. Herhatosmanoglu, D. A. I. Stanoi, and A. Abbadi. Constrained Nearest Nieghbor Queries. In SSTD, 2001.
11. C. Hjaltason and H. Samet. Incremental Distance Join Algorithms for Spatial Databases. In ACM SIGMOD, 1998.
12. C. Hjaltason and H. Samet. Distance Browsing for Spatial Databases. ACM TODS, pages 265-318, 2 1999.
13. F. Korn and S. Muthukrishnan. Influence sets based on reverse nearest neighbor queries. In ACM SIGMOD, 2000.
14. F. Korn, S. Muthukrishnan, and D. Srivastava. Reverse nearest neighbor aggregates over data stream. In VLDB, 2002.
15. F. Li, D. Chen, M. Hadjieleftherious, G. Kollios, and S. Teng. On trip planning queries in spatial databases. In SSTD, 2005.
16. X. Ma, S. Shekhar, H. Xiong, and P. Zhang. Exploiting a page-level upper bound for multi-type nearest neighbor queries. In TR 05-008, CS, UMN, 2005.
17. D. Papadias, Y. T. Q. Shen, and K. Mouratidis. Group nearest neighbor queries. In ICDE, 2004.
18. A. Papadopoulos and Y. Manolopoulos. Performance of Nearest Neighbor Queries in R-trees. In ICDT, pages 394-408, 1997.
19. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer Verlag, 1985.
20. N. Roussopoulos and F. V. S. Kelly. Nearest Neighbor Queries. In SIGMOD, 1995.
21. M. Sharifzadeh, M. Kolahdouzan, and C. Shahabi. The optimal sequenced route query. In TR 05-840, CS, USC, January 2005.
22. I. Stanoi, D. Agrawal, and A. E. Abbadi. Reverse nearest neighbor queries for dynamic databases. In SIGMOD workshop on Research Issues in data mining and knowledge discovery, 2000.
23. I. Stanoi, M. Riedewald, D. Agrawal, and A. E. Abbadi. Discovery of influence sets in frequently updated databases. In VLDB, 2001.
24. Y. Tao, D. Papadias, and Q. Shen. Continuous Nearest Neighbor Search. In VLDB, 2002.
25. J. Zhang, N. Mamoulis, D. Papadias, and Y. Tao. All-Nearest-Neighbors Queries in Spatial Databases. In SSDBM, 2004.