On B-trees: routing schemes and concurrency

Authors:
Y. S. Kwong;D. Wood
Affiliations:
McMaster University, Hamilton, Ontario;McMaster University, Hamilton, Ontario
Venue:
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
Year:
1980

Citing 3
Cited 1

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Right brother trees

Communications of the ACM
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

A commercial back-end data base system

VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent years B-trees have become a common data structure for representing large data dictionaries. In this paper we investigate the often ignored relationship between routing schemes and the permissible operations in leaf-search B-trees. We show that among the many commonly used routing schemes in the literature, some are cleaner than others, making them more attractive for leaf-search B-trees supporting concurrency.