The CR-Tree Supporting a Circular Property of Objects


The KIPS Transactions:PartD, Vol. 10, No. 7, pp. 1077-1084, Dec. 2003
10.3745/KIPSTD.2003.10.7.1077,   PDF Download:

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 access is low and the bucket utilization is high regardless of object distribution and bucket capacity.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. H. Jun and K. H. Gi, "The CR-Tree Supporting a Circular Property of Objects," The KIPS Transactions:PartD, vol. 10, no. 7, pp. 1077-1084, 2003. DOI: 10.3745/KIPSTD.2003.10.7.1077.

[ACM Style]
Seon Hwi Jun and Kim Hong Gi. 2003. The CR-Tree Supporting a Circular Property of Objects. The KIPS Transactions:PartD, 10, 7, (2003), 1077-1084. DOI: 10.3745/KIPSTD.2003.10.7.1077.