All-nearest-neighbors queries in spatial databases

Proceedings of the International Conference on Scientific and Statistical Database Management, SSDBM

Volumn 16, Issue , 2004, Pages 297-306

  Zhang, Jun ^a   Mamoulis, Nikos ^b   Papadias, Dimitris ^c   Tao, Yufei ^d  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

^c HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^d CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; COSTS; DATA REDUCTION; GEOGRAPHIC INFORMATION SYSTEMS; QUERY LANGUAGES; TREES (MATHEMATICS); VLSI CIRCUITS;

ALL-NEAREST NEIGBORS (ANN); MINIMUM BOUNDING RECTANGLE (MBR); PARTITION BASED SPATIAL MERGE JOIN (PBSM); QUERY PROCESSING;

DATABASE SYSTEMS;

EID: 5444228951     PISSN: 10993371     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. [APR+98] L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, J.S. Vitter, Scalable Sweeping-Based Spatial Join, VLDB, 1998.
2. [AY01] C. C. Aggarwal, P. S. Yu, Outlier Detection for High Dimensional Data, SIGMOD, 2001.
3. [BBKK97] S. Berchtold, C. Böhm, D. A. Keim, H.P Kriegel, A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space, PODS, 1997.
4. [BEKS00] B. Braumuller, M. Ester, H. Kriegel, J. Sander, Efficiently Supporting Multiple Similarity Queries for Mining in Metric Databases, ICDE, 2000.
5. [Bia69] T. Bially, Space-filling Curves: Their Generation and Their Application to Bandwidth Reduction, IEEE TIT 15(6):658-664, 1969.
6. [BK02] C. Böte, F. Krebs, High Performance Data Mining Using the Nearest Neighbor Join, ICDM, 2002.
7. [BKS93] T. Brinkhoff, H.P. Kriegel, B. Seeger, Efficient Processing of Spatial Joins Using R-trees, SIGMOD, 1993.
8. [BKSS90] N. Beckmann, H.P. Kriegel, R. Schneider, B. Seeger, The R*-tree: an Efficient and Robust Access Method for Points and Rectangles, SIGMOD, 1990.
9. [Cla83] K. Clarkson. Fast Algoritihms for the All-nearest-neighbors Problem, FOCS, 1983.
10. [CMTV00] A. Corral, Y. Manolopoulos, Y. Theodoridis, M. Vassilakopoulos, Closest Pair Queries in Spatial Databases, SIGMOD, 2000.
11. [CMTV01] A. Corral, Y. Manolopoulos, Y. Tneodoridis, M. Vassilakopoulos, Algorithms for Processing Closest Pair Queries in Spatial Databases, www-de.csd.auth.gr/publication.html), 2001.
12. [Gut84] A. Guttman, R-trees: A Dynamic Index Structure for Spatial Searching, SIGMOD, 1984.
13. [GTW93] M.T. Goodrich, J.J. Tsay, D.E. Vengroff, and S. Vitter, External Memory Computational Geometry, FOCS, 1993.
14. [HS98] G. Hjaltason, H. Samet, Incremental Distance Join Algorithms for Spatial Databases, SIGMOD, 1998.
15. [JMF99] A. Jain, M. Murthy, P. Flynn, Data Clustering: A Review, ACM Computing Surveys, 31(3): 264-323, 1999.
16. [LEL97] S. T. Leutenegger, J. M. Edgington, M. A. Lopez, STR: A Simple and Efficient Algorithm for R-Tree Packing, ICDE, 1997.
17. [LR94] M.L. Lo, C.V. Ravishankar, Spatial Joins Using Seeded Trees, SIGMOD, 1994.
18. [Map] http://www.maproom.psu.edu/dcw.
19. [MP99] N. Mamoulis, D. Papadias, Integration of Spatial Join Algorithms for Processing Multiple Inputs, SIGMOD, 1999.
20. [NO97] K. Nakano, S. Olariu, An Optimal Algorithm for the Angle-Restricted All Nearest Neighbor Problem on the Reconfigurable Mesh, with Applications, IEEE TPDS 8(9): 983-990, 1997.
21. [NTM01] A. Nanopoulos, Y. Theodoridis, Y. Manolopoulos, C2P: Clustering based on Closest Pairs, VLDB, 2001.
22. [PD96] J.M. Patel, D.J. DeWitt, Partition Based Spatial-Merge Join, SIGMOD, 1996.
23. [PM97] A. Papadopoulos, Y. Manoloponlos, Performance of Nearest Neighbor Queries in R-Trees, ICDT, 1997.
24. [PS85] F. Preparata, M. Shamos, Computational Geometry, Springer, 1985.
25. [RKV95] N. Roussopoulos, F. Kelley, F. Vincent, Nearest Neighbour Queries, SIGMOD, 1995.
26. [SML00] H. Shin, B. Moon, S. Lee, Adaptive Multi-Stage Distance Join Processing, SIGMOD, 2000.
27. [SYUK00] Y. Sakurai, M. Yoshikawa, S. Uamura, H. Kojima, The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation, VLDB, 2000.