Abstract
We present a new concurrent Blink-tree algorithm that provides a concurrent tree restructuring mechanism for handling underflow nodes as well as overflow nodes. Our algorithm does not require any lock for downward searching and preserves bottom-up tree restructuring without deadlock. To this end, we develop a new locking mechanism for inserters and deleters and a node update rule that preserves the semantical tree consistency during tree restructuring. Our analytical experiment shows that the overhead of additional disk I/O is acceptable.
This research was supported by IRC (Internet Information Retrieval Research Center) in Hankuk Aviation University. IRC is a Kyounggi-Province Regional Research Center designed by Korea Science and Engineering Foundation and Ministry of Science & Technology.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Comer: The Ubiquitous B-tree. ACM Computing Surveys, 11(2) (1979) 121–137
Bayer, R. and Schkolnick, M.: Concurrency of Operations on B-Trees. Acta Informatica 9 (1977) 1–21
Philip L. Lehman and S. Bing Yao: Efficient Locking for Concurrent Operations. ACM Transactions on Database Systems 6(4) (1981) 650–670
Udi Manber and Richard E. Ladner: Concurrency Control In a Dynamic Search Structure. ACM Transactions on Database Systems 9(3) (1984) 439–455
Yat-Sang Kwong and Derick Wood: A New Method for Concurrency in B-Trees. IEEE Transactions on Software Engineering 8(3) (1982) 211–222
Yehoshua Sagiv: Concurrent Operations on B*-Tree with Overtaking. Journal of Computer and System Science 33(2) (1986) 275–296
Shasha, D. and Goodman, N.: Concurrent Search Structure Algorithms. ACM Transactions on Database Systems 13(1) (1988) 53–90
C. Mohan: ARIES:IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging. ACM SIGMOD 21 (1992) 371–380
Ragaa Ishak: Semantically Consistent Schedules for Efficient and Concurrent B-Tree Restructuring. International Conference on Data Engineering (1992) 184–191
Chendong Zou and Betty Salzberg: On-line Reorganization of Sparsely-populated B+-trees. ACM SIGMOD 25 (1996) 115–124
Jan Jannink: Implementing Deletion in B+-Trees. ACM SIGMOD 24 (1995) 33-38
Gray, J. and Reuter, A.: Transaction Processing: Concepts and Techniques. Reading Mass (1993) 449–490. Morgan Kaufmann Pub.
Johnson, T. and Shasha, D.: The Performance of Current B-Tree Algorithms. ACM Transactions on Database Systems, 18(1) (1993) 51–101
V. Shrinivasan and Michael J. Carey: Performance of B+ Tree Concurrency Control Algorithms. VLDB Journal 2 (1993) 361–406
Johnson, T. and Shasha, D.: The Performance of Current B-Tree Algorithms. ACM Transactions on Database Systems 18(1) (1993) 51–101
Jayant R. Haritsa and S. Seshadri: Real-Time Index Concurrency Control. SIGMOD Record 25(1) (1996) 13–17
Theodore Johnson and Dennis Shasha: B-trees with Inserts and Deletes: Why Free-at-Empty is Better than Merge-at-Half. Journal of Computer and System Science 40 (1993) 45–76
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lim, SC., Ahn, J., Kim, M.H. (2003). A Concurrent Blink-Tree Algorithm Using a Cooperative Locking Protocol. In: James, A., Younas, M., Lings, B. (eds) New Horizons in Information Management. BNCOD 2003. Lecture Notes in Computer Science, vol 2712. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45073-4_20
Download citation
DOI: https://doi.org/10.1007/3-540-45073-4_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40536-8
Online ISBN: 978-3-540-45073-3
eBook Packages: Springer Book Archive