Concurrency control in B+-trees databases using preparatory operations

Authors:
Yehudit Mond;Yoav Raz
Affiliations:
-;-
Venue:
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
Year:
1985

Citing 0
Cited 4

B-trees, shadowing, and clones

ACM Transactions on Storage (TOS)
MARK-OPT: A Concurrency Control Protocol for Parallel B-Tree Structures to Reduce the Cost of SMOs

IEICE - Transactions on Information and Systems
Modern B-Tree Techniques

Foundations and Trends in Databases
Reduced split/merge propagation in a modified B-link tree design

Journal of Computational Methods in Sciences and Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

A simple concurrency control mechan- ism for B+-trees Databases is intro- duced. It is based on early split- ting and catenating of nodes during a process, which are candidates for such operations later on in that process. These early operations enable to lock only the current node in the process and its father node, and hence to increase the degree of concurrency relatively to other known mechanisms.