Reduced split/merge propagation in a modified B-link tree design

Edward T. Hammerand, Haozhe Su · Journal of Computational Methods in Sciences and Engineering · 2011

For concurrent database access, the B-link tree is a well-suited data structure; this paper describes a modification of the B-link tree to reduce the expense associated with splits and merges while moving down the tree. The modification is keyed to t

Read the paper · More papers on PaperTik