Journal of KIISE:Databases (한국정보과학회논문지:데이타베이스)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

An Efficient Method for Finding K Nearest Pairs in Spatial Databases

공간 데이타베이스에서 최근접 K쌍을 찾는 효율적 기법

  • 신효섭 (서울대학교 컴퓨터공학부) ;
  • 이석호 (서울대학교 컴퓨터공학부)
  • Published : 2000.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

The distance join has been introduced previously, which finds nearest pairs in the order of distance incrementally among two spatial data sets built with multidimensional indexes like R-trees. We propose efficient K-distance joins when the number(K) of pairs to find is preset. Especially, we develop a distance join algorithm with bi-directional expansion and optimized plane sweeping using selection method of sweep axis and direction. The experiments on real spatial data sets show that the proposed algorithm is much better than the former algorithms.

R 트리와 같은 다차원 인덱스로 구성된 2개의 공간 데이타 집합들에 대하여 거리가 가까운 순서대로 점진적으로 객체 쌍을 찾는 거리조인(distance join) 알고리즘이 이전에 제안된 바 있다. 본 논문에서는 찾고자 하는 객체 쌍의 개수 K를 미리 정할 때 거리 우선순위 큐를 이용한 효율적인 K-거리조인 기법을 제안한다. 특히 양쪽 노드 확장 방식과 스위핑 축 및 방향의 선택 기법을 이용한 최적화된 평면 스위핑 가지치기 기법을 통한 거리조인 알고리즘을 개발한다. 실제 지리정보 데이타 집합을 가지고 실험을 수행하여 본 논문에서 제안한 알고리즘이 기존의 알고리즘들보다 좋은 성능을 나타냄을 확인한다.

Keywords

References

  1. Arya S., Mount D. M., Netanyahu N. S., Silverman R., 'An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions,' Journal of ACM, to appear, 1999
  2. Berchtold S., Bohm C., Keim D. A., Kriegel H. P., 'A Cost Model for Nearest Neighbor Search in High-Dimensional Data Space,' ACM PODS, 1997 https://doi.org/10.1145/263661.263671
  3. Donjerkovic D. and Ramakrishnan R., 'Probabilistic Optimization of Top N Queries,' CS-TR-99-1395, UW-Madison, 1999
  4. Hjaltason G. R. and Samet H., 'Ranking in Spatial Databases,' Proc. of 4th Symp. on Spatial Datanases, 1995
  5. Roussopoulos N., Kelley S., Vincent F., 'Nearest Neighbor Queries,' Proc. of ACM SIGMOD, 1995
  6. Seidl T. and Kriegel H.P., 'Optimal Multi-Step k-Nearest Neighbor Search,' Proc. of ACM SIGMOD, 1998 https://doi.org/10.1145/276304.276319
  7. Arge L., Procepiue O., Ramaswamy S., Suel T., Vitter J. S., 'Scalable Sweeping-Based Spatial Join' Proc. of VLDG conf., 1998
  8. Brinkhoff T., Kriegel H. P., Seeger B., 'Efficient Processing of Spatial Joins Using R-Trees,' Proc. of ACM SIGMOD, 1993 https://doi.org/10.1145/170035.170075
  9. Patel J. M. and DeWitt D. J., 'Partition Based Spatial-Merge Join', Proc. of ACM SIGMOD, 1996 https://doi.org/10.1145/233269.233338
  10. Hjaltason G. R. and Samet H., 'Incremental Distance Join Algorithms for Spatial Databases,' Proc. of ACM SIGMOD, 1998 https://doi.org/10.1145/276304.276326
  11. Beckmann N., Kriegel H. P., Schneider R., Seeger B., 'The R*-tree: An Efficient and Robust Access Method for Points and Rectangles,' Proc. of ACM SIGMOD, 1990
  12. Berchtold S., Keim D., Kriegel H. P., 'The X-Tree: An Index Structure for High-Dimensional Data,' Proc. of VLDB conf, 1996
  13. Guttman A., 'R-Trees: A Dynamic Index Structure for Spatial Searching,' Proc. of ACM SIGMOD, 1984 https://doi.org/10.1145/602259.602266
  14. Sellis T., Roussopoulos N., Faloutsos C., 'The R+-Tree: A Dynamic Index for Multi-Dimensional Objects,' Proc. of VLDB conf. 1987
  15. Henrich A., 'The $LSD^{h}$-tree: An Access Structure for Feature Vectors', Proc. of ICDE, 1998 https://doi.org/10.1109/ICDE.1998.655799
  16. Robinson J. T., 'The K-D-B-tree: A Search Structure for Large Multidimensional Dynamic Indexes,' Proc. of ACM SIGMOD, 1981