Browse > Article

An Efficient Concurrency Control Algorithm for Multi-dimensional Index Structures  

김영호 (한국전자통신연구원)
송석일 (충북대학교 정보통신공학과)
유재수 (충북대학교 전기전자 및 컴퓨터공학부)
Publication Information
Journal of KIISE:Databases / v.30, no.1, 2003 , pp. 80-94 More about this Journal
Abstract
In this paper. we propose an enhanced concurrency control algorithm that minimizes the query delay efficiently. The factors that delay search operations and deteriorate the concurrency of index structures are node splits and MBR updates in multi dimensional index structures. In our algorithm, to reduce the query delay by split operations, we optimize exclusive latching time on a split node. It holds exclusive latches not during whole split time but only during physical node split time that occupies small part of whole split time. Also to avoid the query delay by MBR updates we introduce partial lock coupling(PLC) technique. The PLC technique increases concurrency by using lock coupling only in case of MBR shrinking operations that are less frequent than MBR expansion operations. For performance evaluation, we implement the proposed algorithm and one of the existing link technique-based algorithms on MIDAS-III that is a storage system of a BADA-III DBMS. We show through various experiments that our proposed algorithm outperforms the existing algorithm In terms of throughput and response time.
Keywords
concurrency control; recovery; multi-dimensional index structure;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 A. Guttman, 'R-Trees: A dynamic index structure for spatial searching', In Proc. ACM SIGMOD Conf., pp. 47-57, 1984   DOI
2 K. Lin, H. V. Jagadish and C. Faloutsos. 'The TV-Tree an index structure for high dimensional data,' VLDB Journal, pp. 517-542, 1994   DOI
3 M. Kornacker and D. Banks, 'High-Concurrency Locking in R-Trees,' In Proc. VLDB Conf., pp. 134-145, 1995
4 V. Ng and T. Kamada, 'Concurrent Accesses to R-Trees,' In Proc. SLSD Conf., pp. 142-161, 1993
5 N. Beckmann, H.P. Kornacker, R. Schneider and B. Seeger, 'The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles,' In Proc. ACM SIGMOD Conf., pp. 322-331, 1990   DOI
6 T.Sellis, N. Roussopoulos and C. Faloutsos. 'The R+ - Tree: a dynamic index for multi-dimensional objects,' In Proc. VLDB Conf., pp. 507-518, 1987
7 Jae Soo Yoo, Myung Geun Shin, Seok Hee Lee, Kil Seong Choi, Ki Hyung Cho and Dae Young Hur, 'An Efficient Index Structure for High Dimensional Image Data,' In Proc. AMCP Conf., pp. 134-147, 1998
8 S. Berchtold, D. A. Keim and H. P. Kriegel. 'The X-Tree: An index structure for high-dimensional data,' In Proc. VLDB Conf., pp. 28-39, 1996
9 이석희, 유재수, 조기형, 허대영, 'CIR-Tree : 효율적인 고차원 색인기법,' 한국정보과학회 논문지(B), 한국정보과학회, 제26권 제6호, pp. 724-734, 1999
10 M. Kornacker, C. Mohan and J. M. Hellerstein, 'Concurrency and Recovery in Generalized Search Trees,' In Proc. ACM SIGMOD Conf., pp. 62-72, 1997
11 K.V.Ravi Kanth, David Serena and Ambuj K.Singh, 'Improved Concurrency Control Techniques for Multi-dimensional Index Structures,' In Proc. IPPS/SPDP Conf., pp. 580-586, 1998   DOI
12 P.L. Lehmann and S.B. Yao, 'Efficient locking for concurrent operations on B-Trees,' ACM TODS, 6(4), pp. 650-670, 1981   DOI   ScienceOn