The KIPS Transactions:PartD (정보처리학회논문지D)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

Concurrency Control and Recovery Methods for Multi-Dimensional Index Structures

다차원 색인구조를 위한 동시성제어 기법 및 회복기법

  • 송석일 (충북대학교 대학원 전기전자컴퓨터공학부 정보통신공학과) ;
  • 유재수 (충북대학교 전기전자컴퓨터공학부)
  • Published : 2003.04.01
Download PDF
⟨ Previous Next ⟩

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.

이 논문에서는 다차원 색인구조의 동시성을 최대화하는 동시성제어 알고리즘과 이를 위한 회복기법을 제안한다. 다차원 색인구조에서 동시성을 저하는 가장 큰 요인은 MBR 변경연산과 분할 연산이다. 제안하는 알고리즘은 먼저 MBR 변경연산으로 인한 동시성 저하를 최소화하기 위해서 PLC(Partial Lock Coupling) 기법을 제안한다. 이 기법은 기존 방법에 비해 잠금결합을 사용하는 회수를 크게 줄여 동시성을 높인다. 또한, MBR 변경의 수행 중에도 탐색자들이 해당 노드를 접근할 수 있도록 하는 MBR 변경 방법을 제안한다. 분할로 인한 동시성 저하를 해결하기 위해서 노드 분할로 인한 탐색자의 지연 시간을 최소화 할 수 있는 새로운 분할방법을 제안한다. 제안하는 알고리즘을 BADA-4 DBMS의 저장시스템인 MiDAS-3에서 구현하여 성능평가를 수행한다. 다양한 실험을 통해 제안하는 방법이 기존 방법보다 우수함을 보인다. 마지막으로, 이 논문에서는 제안하는 동시성제어 방법에 적절한 회복기법을 제안한다. 회복기법은 동시성을 최대한 보장할 수 있도록 설계되었으며 빠른 회복시간을 보장한다.

Keywords

References

  1. A. Guttman, 'R-Trees : a dynamic index structure for spatial searching,' In Proc. ACM SIGMOD, pp.47-57, 1984 https://doi.org/10.1145/602259.602266
  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,' In Journal of ACM TODS, 17(1), pp.94-162, March, 1992 https://doi.org/10.1145/128765.128770
  3. 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 https://doi.org/10.1145/130283.130338
  4. D. A. White and R. Jain, 'Similarity Indexing with the SS-tree,' In Proc. of ICDE, pp.516-523, 1996 https://doi.org/10.1109/ICDE.1996.492202
  5. 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 https://doi.org/10.1016/S0020-0255(96)00219-8
  6. 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
  7. K. Chakrabarti and S. Mehrotra, 'The Hybrid Tree : an index structure for high-dimensional feature spaces,' In Proc. of ICDE, pp.440-447, 1999 https://doi.org/10.1109/ICDE.1999.754960
  8. 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 https://doi.org/10.1007/BF01231606
  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,' The 1995 Workshop on Network and System Management, 1995
  10. 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 https://doi.org/10.1145/253260.253272
  11. M. Kornacker and D. Banks, 'High-Concurrency Locking in R-Trees,' Proceeding of International Conference VLDB, pp.134-145, September, 1995
  12. 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 https://doi.org/10.1145/93597.98741
  13. 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 https://doi.org/10.1145/253260.253347
  14. P. L. Lehmann and S. B. Yao, 'Efficient Locking for Concurrent Operations on B-Trees,' ACM TODS, 6(4), pp.650-670, December, 1981 https://doi.org/10.1145/319628.319663
  15. 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
  16. 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
  17. V. Ng and T. Kamada, 'Concurrent Accesses to R-Trees,' Proceeding of Symposium on 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,' In Proc. of ICDE Conf., pp.446-454, 1998 https://doi.org/10.1109/ICDE.1998.655807
  20. K. Chakrabarti and S. Mehrotra, 'Efficient Concurrency Control in Multidimensional Access Mehtods,' In Proc. of SIGMOD Conf., pp.25-36, 1999 https://doi.org/10.1145/304182.304185