Symmetric binary B-Trees: Data structure and maintenance algorithms
- 597 Downloads
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.
Unable to display preview. Download preview PDF.
- 1.Adelson-Velskii, G. M., Landis, E. M.: An information organization algorithm. DANSSSR 146, 263–266 (1962).Google Scholar
- 2.Bayer, R., McCreight, E. M.: Organization and maintenance of large ordered indexes. Acta Informatica 1, 173–189 (1972).Google Scholar
- 3.Bayer, R.: Binary B-trees for virtual memory. Proceedings of 1971 ACM SIGFIDET Workshop on Data Description, Access and Control, edited by E. F. Codd and A. L. Dean. pp. 219–235 (Nov. 11–12, 1971), San Diego.Google Scholar
- 4.Foster, C. C.: Information storage and retrieval using AVL-trees. Proc. ACM 20th Nat'l. Conf., p. 192–205. 1965.Google Scholar
- 5.Knott, G. D.: A balanced tree structure and retrieval algorithm. Proc. of Symposium on Information Storage and Retrieval, Univ. of Maryland, April 1–2, 1971, PP. 175–196.Google Scholar
- 6.Knuth, D. E.: The art of computer programming, vol. 1. Addison-Wesley, 1969.Google Scholar
- 7.Nievergelt, J., Reingold, E. M.: Binary search trees of bounded balance. To appear, Proceedings of 4th ACM SIGACT Conference 1972.Google Scholar