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

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

DOI QR Code

A Concurrency Control Method for Non-blocking Search Operation based on R-tree

논 블록킹 검색연산을 위한 R-tree 기반의 동시성 제어 기법

  • 김명근 (인하대학교 대학원 전자계산공학과) ;
  • 배해영 (인하대학교 전자계산공학과)
  • Published : 2004.08.01
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we propose a concurrency control algorithm based on R-tree for spatial database management system. The previous proposed algorithms can't prevent problem that search operation is to be blocking during update operations. In case of multidimensional indexes like R-tree, locking of update operations may be locked to several nodes, and splitting of nodes have to lock a splitting node for a long time. Therefore search operations have to waiting a long time until update operations unlock. In this paper we propose new algorithms for lock-free search operation. First, we develop a new technique using a linked-list technique on the node. The linked-list enable lock-free search when search operations search a node. Next, we propose a new technique using a version technique. The version technique enable lock-free search on the node that update operations is to be splitting.

본 논문에서는 검색 위주의 공간 데이터베이스 시스템을 위한 R-tree 기반의 동시성 제어 기법을 제안한다. 기존의 제안된 기법들은 검색연산이 갱신연산과 동시에 수행되는 것을 막기 위해 노드에 공유 락이나 래치를 획득함으로써 갱신연산으로 인한 검색연산의 블록킹을 막을 수 없다는 문제를 가지고 있으며, 또한 R-tree같은 다차원 색인의 경우 갱신연산의 락 획득은 여러 노드에 걸쳐 일어날 수 있으며, 노드 분할과 같은 경우 오랜 시간동안 락을 획득하고 있을 수도 있기 때문에 검색연산은 장시간 블록킹이 되어야 하는 문제를 갖는다. 따라서 본 논문에서는 이러한 문제를 해결하기 위하여 노드의 엔트리들을 링크드 리스트로 연결하는 방법을 사용하여 노드에 엔트리를 삽입하고 있는 중에도 락이나 래치를 획득하지 않고 검색연산을 할 수 있는 링크드 리스트 기반의 동시성 제어 기법과, 노드 분할이 진행 중에 있는 노드에도 검색연산이 락이나 래치를 획득하지 않고 노드를 탐색할 수 있는 버전 기반의 동시성 제어 기법을 제안한다.

Keywords

References

  1. R. Bayer and E. McCeight, Organization and Maintenance of Large Ordered Indexes, Acta informatica, Vol.1, No.3, pp.173-189, 1972 https://doi.org/10.1007/BF00288683
  2. N. Beckmann, H. Kriegel, R. Schneider and B. Seeger, The R*tree : An Efficient and robust access method for points and rectangles, Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, pp.322-331, 1990 https://doi.org/10.1145/93597.98741
  3. S. Berchtold, D. A. Keim and H. P. Kereigel, The X-tree : An index structure for high dimensional data, Proceedings of the Int. Conf. on Very Large Data Bases, 1996
  4. K. Eswaren, J. Gray, R. Lorie and I. Traiger, On the Notions of Consistency and Predicate Locks in a Database System, Comm. ACM, Vol.19, No.11, pp.624-633, November, 1976 https://doi.org/10.1145/360363.360369
  5. A. Guttman, R-trees : A dynamic index structure for spatial searching, Proc. ACM SIGMOD Int. Conf. on Management of Data, pp.47-57, 1984
  6. H. V. Jagadish, Dan Lieuwen, Rajeev Rastogi, Avi Silberschatz and S. Sudarshan, Dali : A high performance main-memory storage manager, In Proc. of the Int. Conf. on Very Large DataBases, 1994
  7. M. Kornacker and D. Banks, High-Concurrency Locking in R-Trees, Proceedings of the Int. Conf. on Very Large Data Bases, pp.134-145, September, 1995
  8. M. Kornacker, C. Mohan, and J. Hellerstein, Concurrency control and recovery in GiST, Proc. ACM SIGMOD Int. Conf. on Management of Data, 1997
  9. T. J. Lehman and M. J. Carey, A study of index structures for main memory database management systems, In Proc. of the Conf. on Very Large Data Bases, 1997
  10. P. Lehman and S. Yao, Efficient Locking for Concurrent Operations on B-Trees, Vol.6, No.4, December, 1981 https://doi.org/10.1145/319628.319663
  11. H. V. Lin, K. Jagadish and C. Faloutsos, The TV-tree : an index structure for high dimensional data, In VLDB Journal, 1994 https://doi.org/10.1007/BF01231606
  12. D. Lomet and B. Salzberg, The hB-Tree : A Multiattribute Indexing Method with Good Guaranteed Performance, ACM TODS, Vol.15, No.4, pp.625-685, December, 1990 https://doi.org/10.1145/99935.99949
  13. J. Nievergelt, H. Hinterberger and K. C. Sevcik, The Grid File : An Adaptable, Symmetric Multikey File Structure, ACM TODS, Vol.9, No.1, March, 1984 https://doi.org/10.1145/348.318586
  14. R. Rastogi, S. Seshadri, P. Bohannon, D. Leinbaugh, A. Silberschatz and S. Sudarshan, Logical and Physical Versioning in Main Memory Databases, In Proc of the Int. Conf. on Very Large Data Bases, August, 1997
  15. K. V. Ravi Kanth, Divyakant Agrawal;Ambuj K Singh, Improved concurrency control techniques for multi-dimensional index structures, Technical Report, Univ. of California at santa Barbara, 1998
  16. J. T. Robinson, The K-D-B-Tree : A Search Structure for Large Multidimensional Dynamic Indexes, Proc. ACM SIGMOD Conf., pp.10-18, 1981
  17. D. White and R. Jain, Similarity indexing with the SS-tree, Proc. Int. Conf. on Data Engineering, pp.516-523, 1996 https://doi.org/10.1109/ICDE.1996.492202
  18. T. Sellis, N. Roussopoulos, C. Faloutsos, The R+-Tree : A Dynamic Index for Multi-Dimensional Objects, In VLDB Journal, 1987
  19. V. Srinivasan and M. Carey. Performance of b-tree concurrency control algorithms, Proc. ACM SIGMOD Int. Conf. on Management of Data, pp.416-425, April, 1995 https://doi.org/10.1145/115790.115860