Symmetric binary B-Trees: Data structure and maintenance algorithms

@article{Bayer2004SymmetricBB,
  title={Symmetric binary B-Trees: Data structure and maintenance algorithms},
  author={R. Bayer},
  journal={Acta Informatica},
  year={2004},
  volume={1},
  pages={290-306}
}
  • R. Bayer
  • Published 2004
  • Mathematics, Computer Science
  • Acta Informatica
SummaryA 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. 
355 Citations
Deleting keys of B-trees in parallel
  • 2
Deleting keys of B-trees in parallel
  • PDF
Dynamic weighted binary search trees
  • K. Unterauer
  • Mathematics, Computer Science
  • Acta Informatica
  • 2004
  • 7
Red-black trees with relative node keys
  • 1
  • PDF
Stratified balanced search trees
  • 9
  • PDF
S(b)-Trees: An Optimal Balancing of Variable Length Keys
  • 1
  • PDF
Partitioned Binary Search Trees: A Generalization of Red Black Trees
The ibs-tree: a data structure for finding all intervals that overlap a point. technical report wsu-
  • 10
Parallelizing the Construction of a k-Dimensional Tree
  • 1
Interval Merging Binary Tree
  • 3
...
1
2
3
4
5
...

References

SHOWING 1-8 OF 8 REFERENCES
Binary B-trees for virtual memory
  • R. Bayer
  • Computer Science
  • SIGFIDET '71
  • 1971
  • 111
A balanced tree storage and retrieval algorithm
  • 18
  • PDF
Binary Search Trees of Bounded Balance
  • 189
Information retrieval: information storage and retrieval using AVL trees
  • 59
Organization and maintenance of large ordered indexes
  • 977
  • PDF
The Art of Computer Programming
  • 11,866
A balanced tree structure and retrieval algorithm
  • Proc . of Symposium on Information Storage and Retrieval
An informatioh organization algorithm
  • DANSSSR