Accession Number:

ADA110391

Title:

The Super-B-Tree Algorithm.

Descriptive Note:

Technical rept.,

Corporate Author:

HARVARD UNIV CAMBRIDGE MA AIKEN COMPUTATION LAB

Personal Author(s):

Report Date:

1979-01-01

Pagination or Media Count:

39.0

Abstract:

In the traditional literature concerning AVL 2-3, bounded balance or multiway B-trees, it has been assumed that a pointer-changing operation would require approximately one unit of runtime. This approximation is inapplicable to the augmented trees of BS77, Lu78b, Wi78a and Wi78c, because these threes associate an auxiliary data structure to each interior node, which complicates the cost of pointer-changing operations. Such an operation will consume 1 Jw units of runtime in an augmented three application where J denotes the number of records that gain a new ancestor as a result of the pointer-changing operation, and w is a coefficient depending on the particular application. The purpose of this paper is to propose an algorithm which is a generalization of traditional B-trees designed to possess an Owlog N worst-case insertion and deletion runtime in an augmented tree environment. This algorithm is significant because it has the optimal runtime order of magnitude.

Subject Categories:

  • Information Science
  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE