Concurrent Use of B-trees with Variable-Length Entries

@article{Keller1988ConcurrentUO,
  title={Concurrent Use of B-trees with Variable-Length Entries},
  author={Arthur M. Keller and Gio Wiederhold},
  journal={SIGMOD Record},
  year={1988},
  volume={17},
  pages={89-90}
}
I n t r o d u c t i o n Recent published work provides a solution to a vexing problem in implementing concurrent access to B-trees. The problem occurs when the dichromatic technique to enhance concurrent acces [Guibas and Sedgewick 78] is applied to B-trees with variablelength entries. This technique involves presplitting of B-tree blocks when the tree is traversed from the root down to its leaves to prepare for an update. Any block encountered which is full, e.g., it will not be able to accept… CONTINUE READING