The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Linear clustering of objects with multiple attributes
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A model for the prediction of R-tree performance
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The SR-tree: an index structure for high-dimensional nearest neighbor queries
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
The Impact of Global Clustering on Spatial Database Systems
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
The Spatial Locality and a Spatial Indexing Method by Dynamic Clustering in Hypermap System
SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
Spatial queries in dynamic environments
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
To increase the retrieval performance in spatial and multimedia database systems, it is required to develop spatial indexing methods considering the spatial locality. The spatial locality is related to the location property of objects. Most spatial indexing methods, however, were not considered the circular location property of objects. In this paper, we propose a dynamic spatial index structure, called CR*-tree. It is a new spatial index structure to support the circular location property of objects in which a search space is organized with the circular and linear domains. We include the performance test results that verify this advantage of the CR*-tree and show that the CR*-tree outperforms the R*-tree.