The Community for Technology Leaders
Green Image
Issue No. 05 - May (2009 vol. 21)
ISSN: 1041-4347
pp: 714-728
Chang-Tien Lu , Virginia Polytechnic Institute and State University, Falls Church
Janak Mathuria , Virginia Polytechnic Institute and State University, Falls Church
Jing Dai , Virginia Polytechnic Institute and State University, Falls Church
Ying Jin , Virginia Polytechnic Institute and State University, Falls Church
ABSTRACT
Multidimensional databases are now beginning to be used in a wide range of applications. To meet this fast-growing demand, the R-tree family is being applied to support fast access to multidimensional data, for which the R+-tree exhibits outstanding search performance. In order to support efficient concurrent access in multi-user environments, concurrency control mechanisms for multidimensional indexing have been proposed. However, these mechanisms cannot be directly applied to the R+-tree because an object in the R+-tree may be indexed in multiple leaves. This paper proposes a concurrency control protocol for R-tree variants with object clipping, namely, Granular Locking for clIPping indexing (GLIP), dubbed an R+-tree variant, the Zero-overlap R+-tree (ZR+-tree). To the best of our knowledge, GLIP is the first concurrency control approach designed specifically for the R+-tree and its variants. The proposed GLIP supports efficient concurrent operations on R+-trees with serializable isolation, consistency, and deadlock-free. Experiment results on both real and synthetic data sets validated the effectiveness and efficiency of the proposed concurrent access framework.
INDEX TERMS
Concurrency, Spatial databases, Access methods
CITATION
Chang-Tien Lu, Janak Mathuria, Jing Dai, Ying Jin, "GLIP: A Concurrency Control Protocol for Clipping Indexing", IEEE Transactions on Knowledge & Data Engineering, vol. 21, no. , pp. 714-728, May 2009, doi:10.1109/TKDE.2008.183
175 ms
(Ver 3.1 (10032016))