Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2003.10D.2.195

Concurrency Control and Recovery Methods for Multi-Dimensional Index Structures  

Song, Seok-Il (충북대학교 대학원 전기전자컴퓨터공학부 정보통신공학과)
Yoo, Jae-Soo (충북대학교 전기전자컴퓨터공학부)
Publication Information
The KIPS Transactions:PartD / v.10D, no.2, 2003 , pp. 195-210 More about this Journal
Abstract
In this paper, we propose an enhanced concurrency control algorithm that maximizes the concurrency of multi-dimensional index structures. The factors that deteriorate the concurrency of index structures are node splits and minimum bounding region (MBR) updates in multi-dimensional index structures. The proposed concurrency control algorithm introduces PLC(Partial Lock Coupling) technique to avoid lock coupling during MBR updates. Also, a new MBR update method that allows searchers to access nodes where MBR updates are being performed is proposed. To reduce the performance degradation by node splits the proposed 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-3 that is a storage system of a BADA-4 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.
Keywords
Multi-Dimensional Index Structure; Concurrency Control; Recovery Method;
Citations & Related Records
연도 인용수 순위
  • Reference
1 A. Guttman, 'R-Trees : a dynamic index structure for spatial searching,' In Proc. ACM SIGMOD, pp.47-57, 1984   DOI
2 C. Mohan and F. Levine, 'ARIES/IM : An Efficient and High Concurrency Index Management Mehtod Using Write-Ahead Logging,' In Proc.of ACM SIGMOD, pp.371-380, June, 1992   DOI
3 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,' In Journal of ACM TODS, 17(1), pp.94-162, March, 1992   DOI
4 P. L. Lehmann and S. B. Yao, 'Efficient Locking for Concurrent Operations on B-Trees,' ACM TODS, 6(4), pp.650-670, December, 1981   DOI   ScienceOn
5 K. I. Lin, H. Jagadish and C. Faloutsos, 'The TV-tree : An Index Structure for High Dimensional Data,' In Journal of VLDB, Vol.3, pp.517-542, 1994   DOI
6 D. A. White and R. Jain, 'Similarity Indexing with the SS-tree,' In Proc. of ICDE, pp.516-523, 1996   DOI
7 J. K. Chen and Y. F. Huang, 'A Study of Concurrent Operations On R-Trees,' In Journal of Information Sciences 98, pp.263-300, 1997   DOI   ScienceOn
8 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. of AMCP, pp.134-147, 1998
9 K. Chakrabarti and S. Mehrotra, 'The Hybrid Tree : an index structure for high-dimensional feature spaces,' In Proc. of ICDE, pp.440-447, 1999   DOI
10 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,' The 1995 Workshop on Network and System Management, 1995
11 A. Silberschatz and P. B. Galvin, 'Operating System Concepts,' Addison-Wesley, 1995
12 M. Kornacker, C. Mohan and J. M. Hellerstein, 'Concurrency and Recovery in Generalized Search Trees,' Proceeding of International Conference ACM SIGMOD, pp.62-72, May, 1997   DOI
13 M. Kornacker and D. Banks, 'High-Concurrency Locking in R-Trees,' Proceeding of International Conference VLDB, pp.134-145, September, 1995
14 N. Beckmann, H. P. Kriegel, R. Schneider, B. Seeger, 'The $R^*-tree$ : An Efficient and Robust Access Method for Points and Rectangles,' Proceeding of International Conference ACM SIGMOD, pp.322-331, 1990   DOI
15 N. Katayama and S. Satoh, 'The SR-tree : An Index Structure for High-Dimensional Nearest Neighbor Queries,' Proceeding of International Conference ACM SIGMOD, May, 1997   DOI
16 K. V. Ravi. Kanth, D. Serena and A. K. Singh, 'Improved concurrency control techniques for multi-dimensional index structures,' Proceeding of the First Merged International and Symposium on Parallel and Distributed Processing(IPPS/SPDP), pp.580-586, 1998
17 S. Berchtold, D. A. Keim and H. P. Kriegel, 'The X-Tree : an index structure for high-dimensional data,' In Proc. of VLDB Conf., pp.28-39, 1996
18 V. Ng and T. Kamada, 'Concurrent Accesses to R-Trees,' Proceeding of Symposium on Large Spatial Databases, pp.142-161, 1993
19 K. Chakrabarti and S. Mehrotra, 'Efficient Concurrency Control in Multidimensional Access Mehtods,' In Proc. of SIGMOD Conf., pp.25-36, 1999   DOI
20 K. Chakrabarti and S. Mehrotra, 'Dynamic Granular Locking Approach to Phantom Protection in R-Trees,' In Proc. of ICDE Conf., pp.446-454, 1998   DOI