Browse > Article

Efficient Accesses of R-Trees for Distance Join Query Processing in Multi-Dimensional Space  

Sin, Hyo-Seop (서울대학교 컴퓨터공학부)
Mun, Bong-Gi (미국 아리조나대학교 전산학과)
Lee, Seok-Ho (서울대학교 컴퓨터공학부)
Publication Information
Journal of KIISE:Databases / v.29, no.1, 2002 , pp. 72-78 More about this Journal
Abstract
The distance join is a spatial join which finds data pairs in the order of distance between two spatial data sets using R-trees. The distance join stores node pairs in a priority queue, which are retrieved while traversing R-trees in a top-town manner, in the order of distance. This paper first shows that a priority strategy for the tied pairs in the priority queue during distance join processing has much effect on its performance, and then proposes an optimized secondary priority method. The experiments show that the proposed method is always better than the other methods in the performance perspectives.
Keywords
Distance Join; R-Tree; Secondary Priority;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Hyoscop Shin, Bongki Moon, and Sukho Lee, 'Adaptive Multi-Stagc Distance Join Processing,' Proc. of 2000 ACM-SIGMOD Conference, pages 343-354, Dallas, TX, May 2000
2 신효섭, 이석호, '공간 데이타베이스에서 최근접 K쌍을 찾는 효율적 기법', 정보과학회 논문지: 데이타베이스, 27권 2호, pp.238-246, 2000. 6.   과학기술학회마을
3 Gisli R. Hjaltason, and Hanan Samet, 'Incremental Distance Join Algorithms for Spatial Databases,' Proc. of 1998 ACM-SIGMOD Conference, pages 237- 248, Seattle, WA, June 1998   DOI
4 Antonio Corral, Yannis Manolopoulos, Yannis Thcodoridis, and Michael Vassilakopoulos, 'Closest Pair Quenes in Spatial Databases,' Proc. of 2000 ACM -SIGMOD Conference, pages 189 -200, Dallas, TX, May 2000
5 Antonin Guttman, 'R-Trees: A Dynamic Index Structure for Spatial Searching,' Proc. of .1984 ACM-SIGMOD conference, pages 47-57, Boston, MA, June 1984   DOI
6 Andreas Henrich, 'The $LSD^h-tree:$ An Access Structure for Feature Vectors,' Proc. of 1998 ICDE conference, pages 362-369, Orlando, FL, February 1998
7 Timos K. Sellis, Nick Roussopoulos, and Christos Faloutsos, 'The R+-Tree: A Dynamic Index for Multi-Dimensional Objects,' Proc. of 1987 VLDB conference, pages 507-518, Brighton. England, September 1987
8 Stefan Berchtold, Daniel A. Keim, and Hans-Peter Kriegel, 'The X-Tree: An Index Structure for High-Dimensional Data,' Proc. of 1996 VLDB conference, pages 28-39, Mumbai(Bombay), India, September 1996
9 John T. Robinson, 'The K-D-B-tree: A Search Structure for Large Multidimensional Dynamic Indexes,' Proc. of 1981 ACM-SIGMOD conference, pages 10-18, Ann Arbor, Michigan, April 1981   DOI
10 Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger, 'The R*-trec: An Efficient and Robust Access Method for Points and Rectangles,' Proc, of 1990 ACM-SIGMOD conference, pages 322-331, Atlantic City, NJ, May 1990