This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
GLIP: A Concurrency Control Protocol for Clipping Indexing
May 2009 (vol. 21 no. 5)
pp. 714-728
Chang-Tien Lu, 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
Janak Mathuria, Virginia Polytechnic Institute and State University, Falls Church
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.

[1] M. Abdelguerfi, J. Givaudan, K. Shaw, and R. Ladner, “The 2-3TR-Tree, a Trajectory-Oriented Index Structure for Fully Evolving Valid-Time Spatio-Temporal Datasets,” Proc. 10th ACM Int'l Symp. Advances in Geographic Information System (ACMGIS '02), pp. 29-34, 2002.
[2] N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger, “The R$^{\ast}$ -Tree: An Efficient and Robust Access Method for Points and Rectangles,” Proc. ACM SIGMOD '90, pp. 322-331, 1990.
[3] A. Biliris, “Operation Specific Locking in B-trees,” Proc. Sixth Int'l Conf. Principles of Database Systems (PODS '87), pp. 159-169, 1987.
[4] K. Chakrabarti and S. Mehrotra, “Dynamic Granular Locking Approach to Phantom Protection in R-Trees,” Proc. 14th IEEE Int'l Conf. Data Eng. (ICDE '98), pp. 446-454, 1998.
[5] K. Chakrabarti and S. Mehrotra, “Efficient Concurrency Control in Multi-Dimensional Access Methods,” Proc. ACM SIGMOD '99, pp.25-36, 1999.
[6] J.K. Chen, Y.F. Huang, and Y.H. Chin, “A Study of Concurrent Operations on R-Trees,” Information Sciences, vol. 98, nos. 1-4, pp.263-300, May 1997.
[7] V. Gaede and O. Gunther, “Multidimensional Access Methods,” ACM Computing Surveys, vol. 30, no. 2, pp. 170-231, June 1998.
[8] D. Greene, “An Implementation and Performance Analysis of Spatial Data Access Methods,” Proc. Fifth IEEE Int'l Conf. Data Eng. (ICDE '89), pp. 606-615, 1989.
[9] S. Guha, R. Rastogi, and K. Shim, “CURE: An Efficient Clustering Algorithm for Large Databases,” Proc. ACM SIGMOD '98, pp. 73-84, 1998.
[10] A. Guttman, “R-Trees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD '84, pp. 47-57, 1984.
[11] J. Hellerstein, J. Naughton, and A. Pfeffer, “Generalized Search Trees in Database Systems,” Proc. 21st Int'l Conf. Very Large Data Bases (VLDB '95), pp. 562-673, 1995.
[12] E.G. Hoel and H. Samet, “A Qualitative Comparison Study of Data Structures for Large Line Segment Databases,” Proc. ACM SIGMOD '92, pp. 205-214, 1992.
[13] K.V.R. Kanth, D. Serena, and A.K. Singh, “Improved Concurrency Control Techniques for Multi-Dimensional Index Structures,” Proc. Ninth Symp. Parallel and Distributed Processing (SPDP '98), pp. 580-586, 1998.
[14] M. Kornacker and D. Banks, “High-Concurrency Locking in R-Trees,” Proc. 21st Int'l Conf. Very Large Data Bases (VLDB'95), pp. 134-145, 1995.
[15] M. Kornacker, C. Mohan, and J. Hellerstein, “Concurrency and Recovery in Generalized Search Trees,” Proc. ACM SIGMOD '97, pp.62-72, 1997.
[16] P. Lehman and S. Yao, “Efficient Locking for Concurrent Operations on B-trees,” ACM Trans. Database Systems, vol. 6, no. 4, pp. 650-670, Dec. 1981.
[17] D. Lomet, “Key Range Locking Strategies for Improved Concurrency,” Proc. 19th Int'l Conf. Very Large Data Bases (VLDB '93), pp. 655-664, 1993.
[18] C. Mohan and F. Levin, “ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging,” Proc. ACM SIGMOD '92, pp. 371-380, 1992.
[19] V. Ng and T. Kamada, “Concurrent Accesses to R-Trees,” Proc. Third Symp. Advances in Spatial Databases (SSD '93), pp. 142-161, 1993.
[20] J. Nievergelt, H. Hinterberger, and K.C. Sevcik, “The Grid File: An Adaptable, Symmetric Multikey File Structure,” ACM Trans. Database Systems, vol. 9, no. 1, pp. 38-71, Mar. 1984.
[21] J.A. Orenstein and T.H. Merrett, “A Class of Data Structures for Associative Searching,” Proc. Third Symp. Principles of Database Systems (PODS '84), pp. 181-190, 1984.
[22] J.T. Robinson, “The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes,” Proc. ACM SIGMOD '81, pp. 10-18, 1981.
[23] T. Sellis, N. Roussopoulos, and C. Faloutsos, “The R+-Tree: A Dynamic Index for Multi-Dimensional Objects,” Proc. 13th Int'l Conf. Very Large Data Bases (VLDB '87), pp. 507-518, 1987.
[24] L. Shou, Z. Huang, and K.-L. Tan, “The Hierarchical Degree-of-Visibility Tree,” IEEE Trans. Knowledge Data Eng., vol. 16, no. 11, pp. 1357-1369, Nov. 2004.
[25] S.I. Song, Y.H. Kim, and J.S. Yoo, “An Enhanced Concurrency Control Scheme for Multidimensional Index Structure,” IEEE Trans. Knowledge Data Eng., vol. 16, no. 1, pp. 97-111, Jan. 2004.
[26] Y. Theodoridis, “The R-Tree Portal,” http:/www.rtreeportal.org, 2005.
[27] P.S. Yu, K.-L. Wu, K.-J. Lin, and S.H. Son, “On Real-Time Databases: Concurrency Control and Scheduling,” Proc. IEEE, vol. 82, no. 1, pp. 140-157, Jan. 1994.
[28] D. Zhang and T. Xia, “A Novel Improvement to the R$^{\ast}$ -Tree Spatial Index Using Gain/Loss Metrics,” Proc. 12th ACM Int'l Symp. Advances in Geographic Information Systems (ACMGIS '04), pp. 204-213, 2004.

Index Terms:
Concurrency, Spatial databases, Access methods
Citation:
Chang-Tien Lu, Jing Dai, Ying Jin, Janak Mathuria, "GLIP: A Concurrency Control Protocol for Clipping Indexing," IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 5, pp. 714-728, May 2009, doi:10.1109/TKDE.2008.183
Usage of this product signifies your acceptance of the Terms of Use.