Postorder B-tree construction

  • Authors:

  • Lawrence W. West

  • Affiliations:

  • Virginia Commonwealth University, Richmond, Virginia

  • Venue:
  • ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
  • Year:
  • 1992

Quantified Score

Hi-index 0.00

Visualization

Abstract

A method is presented for building B-trees from a sorted list of records without node splitting. There are several advantages to such an approach. The number of records stored per node can be independently specified for each level of the tree, what Knuth calls a generalized B-tree. Once a node is filled it need not be referenced again. If the tree is being stored on a DASD the number of accesses, O(N/d) for N keys and an order-d tree, will be less than required for methods that use node splitting.