Symmetric binary B-Trees: Data structure and maintenance algorithms

  title={Symmetric binary B-Trees: Data structure and maintenance algorithms},
  author={Rudolf Bayer},
  journal={Acta Informatica},
A class of binary trees is described for maintaining ordered sets of data. Random insertions, deletions, and retrievals of keys can be done in time proportional to log N where N is the cardinality of the data-set. Symmetric B-Trees are a modification of B-trees described previously by Bayer and McCreight. This class of trees properly contains the balanced trees. 
Highly Influential
This paper has highly influenced 20 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
244 Extracted Citations
5 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 244 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-5 of 5 references

Information storage and retrieval using AVL-trees

  • Foster, C C.
  • Proc. ACM 20th Nat'l. Conf.,
  • 1965
1 Excerpt

A balanced tree structure and retrieval algorithm

  • G. D. Knott
  • Proc . of Symposium on Information Storage and…

An informatioh organization algorithm

  • G. M. Adelson-Velskii, E. M. Landis

Similar Papers

Loading similar papers…