This Article 
 Bibliographic References 
 Add to: 
An Enhanced Concurrency Control Scheme for Multidimensional Index Structures
January 2004 (vol. 16 no. 1)
pp. 97-111

Abstract—In this paper, we propose an enhanced concurrency control algorithm that maximizes the concurrency of multidimensional index structures. The factors that deteriorate the concurrency of index structures are node splits and minimum bounding region (MBR) updates in multidimensional index structures. The properties of our concurrency control algorithm are as follows: First, to increase the concurrency by avoiding lock coupling during MBR updates, we propose the PLC (Partial Lock Coupling) technique. Second, a new MBR update method is proposed. It allows searchers to access nodes where MBR updates are being performed. Finally, our algorithm holds exclusive latches not during whole split time but only during physical node split time that occupies the small part of a whole split process. For performance evaluation, we implement the proposed concurrency control algorithm and one of the existing link technique-based algorithms on MIDAS-III that is a storage system of a BADA-IV DBMS. We show through various experiments that our proposed algorithm outperforms the existing algorithm in terms of throughput and response time. Also, we propose a recovery protocol for our proposed concurrency control algorithm. The recovery protocol is designed to assure high concurrency and fast recovery.

[1] A. Guttman, R-Trees: A Dynamic Index Structure for Spatial Searching Proc. ACM SIGMOD, pp. 47-57, 1984.
[2] C. Mohan, D. Harderle, B. Lindsay, H. Pirahesh, and P. Schwarz, ARIES: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write Ahead Logging Trans. Database Systems, vol. 17, no. 1, pp. 94-162, 1992.
[3] C. Mohan and F. Levine, ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging Proc. ACM SIGMOD, pp. 371-380, 1992.
[4] D. White and R. Jain, “Similarity Indexing with the SS-Tree,” Proc. 12th Int'l Conf. Data Eng., 1996.
[5] J.K. Chen and Y.F. Huang, A Study of Concurrent Operations on R-Trees J. Information Sciences, vol. 98, nos. 1-4, pp 263-300, 1997.
[6] J.S. Yoo, M.G. Shin, S.H. Lee, K.S. Choi, K.H. Cho, and D.Y. Hur, An Efficient Index Structure for High Dimensional Image Data Proc. Intl. Conf. Advanced Multimedia Content Processing, pp. 134-147, 1998.
[7] K. Chakrabarti and S. Mehrotra, The Hybrid Tree: An Index Structure for High-Dimensional Feature Spaces Proc. Int'l Conf. Data Eng., pp. 440-447, 1999.
[8] K.I. Lin, H. Jagadish, and C. Faloutsos, The TV-Tree: An Index Structure for High Dimensional Data The VLDB J., vol. 3, no. 4, pp. 517-542, 1994.
[9] M. Chae, K. Hong, M. Lee, J. Kim, O. Joe, S. Jeon, and Y. Kim, Design of the Object Kernel of BADA-III: An Object-Oriented Database Management System for Multimedia Data Service Proc. Workshop Network and System Management, 1995.
[10] M. Kornacker, C. Mohan, and J.M. Hellerstein, Concurrency and Recovery in Generalized Search Trees Proc. ACM SIGMOD, pp. 62-72, 1997.
[11] M. Kornacker and D. Banks, High-Concurrency Locking in R-Trees Proc. Very Large Data Bases Conf., pp. 134-145, 1995.
[12] N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger, The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles Proc. ACM SIGMOD, pp. 322-331, 1990.
[13] N. Katayama and S. Satoh, The SR-Tree: An Index Structure for High-Dimensional Nearest Neighbor Queries Proc. ACM SIGMOD, pp. 369-380, 1997.
[14] P.L. Lehmann and S.B. Yao, Efficient Locking for Concurrent Operations on B-Trees ACM Trans. Database Systems, vol. 6, no. 4, pp. 650-670, 1981.
[15] K.V. Ravi Kanth, D. Serena, and A.K. Singh, Improved Concurrency Control Techniques for Multi-Dimensional Index Structures Proc. Symp. Parallel and Distributed Processing, pp. 580-586, 1998.
[16] S. Berchtold, D.A. Keim, and H.P. Kriegel, The X-Tree: An Index Structure for High-Dimensional Data Proc. Very Large Data Bases Conf., pp. 28-39, 1996.
[17] V. Ng and T. Kamada, Concurrent Accesses to R-Trees Proc. Symp. Large Spatial Databases, pp. 142-161, 1993.
[18] A. Silberschatz and P.B. Galvin, Operating System Concepts. Addison-Wesley, 1995.
[19] K. Chakrabarti and S. Mehrotra, Dynamic Granular Locking Approach to Phantom Protection in R-Trees Proc. Int'l Conf. Data Eng., pp. 446-454, 1998.
[20] K. Chakrabarti and S. Mehrotra, Efficient Concurrency Control in Multidimensional Access Methods Proc. SIGMOD, pp. 25-36, 1999.

Index Terms:
Concurrency control, multidimensional index structure, performance evaluation.
Seok Il Song, Young Ho Kim, Jae Soo Yoo, "An Enhanced Concurrency Control Scheme for Multidimensional Index Structures," IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 1, pp. 97-111, Jan. 2004, doi:10.1109/TKDE.2004.1264825
Usage of this product signifies your acceptance of the Terms of Use.