Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2003.10D.7.1077

The Cr*-Tree Supporting a Circular Property of Objects  

Seon, Hwi-Jun (서남대학교 컴퓨터정보통신학과)
Kim, Hong-Ki (동신대학교 컴퓨터학과)
Publication Information
The KIPS Transactions:PartD / v.10D, no.7, 2003 , pp. 1077-1088 More about this Journal
Abstract
To increase the retrieval performance in spatial database systems, it is required to develop spatial indexing methods considered the spatial locality. The spatial locality is related to the location property of objects. The previous spatial indexing methods are not considered the circular location property that objects will be taken. In this paper, we propose a dynamic spatial index structure called $Cr^*$-tree, and evaluate the performance of the proposed index structure. This is a new spatial index structure considered the circular location property of objects in which a search space is constructed with the circular and linear domains. By the simulation results, the $Cr^*$-tree shows that the number of disk across is low and the bucket utilization is high regardless of object distribution and bucket capacity.
Keywords
Circular Property; Circular Domain; Linear Domain; Spatial Index Structure; $Cr^*$-tree;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 L. K. Joune and L. Robert, 'The Spatial Locality and a Spatial Indexing Method by Dynamic Clustering in Hypermap System,' Proc. of the 2nd Sym. on Large Spatial Databases, pp.207-223, 1991   DOI
2 N. Katayama, S.Satoh, 'The SR-tree : An Index Structure for High-Dimen sional Nearest Neighbor queries,' Proc. ACM SIGMOD Int. Conf. on Management of Data, pp.369-380, 1997   DOI   ScienceOn
3 B. U. Pagel, H. W. Six, H. Toben and P. Widmayer, 'Towards an Analysis of Range Performance is Spatial Data Stuctures,' Proc. of the 12th ACM SIGCT-SIGMOD-SIGART Sym. on Principles of Database Systems, pp.214-221, 1993
4 Y. Theodoridis, 'A Model for Prediction of R-tree Performance,' Proc. of the 15th ACM SIGCT-SIGMOD-SIGART Sym. on Principles of Database Systems, pp.161-171, 1996
5 N. Beckmann, H. Kriegel, R. Schneider and B. Seeger, 'The $R^{\ast}$-tree : an Efficient and Robust Access Method for Points and Rectangles,' Proc.ACM SIGMOD Int. Conf. on Management of Data, pp. 322-331, 1990
6 S. Berchtold, C. Bohm, H. Kriegel, 'Improving the Query Performance of High-Dimensional Index Structures Using Bulk-Load Operations,'6th. Int. Conf. on Extending Database Technology, 1998
7 S. Berchtold, D. Keim, H. Kriegel, 'The X-tree : An Index Structure for High-Dimensional Data,' 22nd Conf. on Very Large Database, pp.28-39, 1996
8 W. G. Aref and H. Samet, 'Optimization Strategies for Spatial Query Processing,' Proc. of the 7th Int. Conf. on VLDB, pp.81-90, 1991
9 R. H. Guting, 'An Introduction to spatial Database Systems,' VLDB Journal, No.3, pp.357-399, Aug., 1994
10 H. V. Jagadish, 'Linear Clustering of Object with Multiple Attributes,' Proc. ACM SIGMOD Int. Conf. on Management of Data, pp.332-342, 1990   DOI
11 T. Brinkhoff and H. P. Kriegel, 'The Impact of Global Clustering on Spatial Database Systems,' Proc. of the 20th VLDB Conf., pp.168-179, 1994
12 A. Henrich and H. W. Six, 'How to Split Buckets in Spatial Data Structures,' Geographic DB Management Systems, Capri (Italy), pp.212-244, May, 1991
13 김흥기, 황부현, '순환도메인을 기반으로 하는 PR-화일의 구현 및 성능 평가,' 제3권, 제1호, pp.63-76, 1996   과학기술학회마을