B-tree
Invented by | Bayer, McCreight (1972) | |
---|---|---|
Idea: |
| |
Advantages: |
| |
Variations: |
|
[You can download the application for offline viewing.]
References
- R. Bayer and E.M. McCreight. Organization and maintenance of large ordered indexes. Acta informatica, 1(3):173-189, 1972. [bib] [pdf]
- D. Comer. Ubiquitous B-tree. ACM Computing Surveys (CSUR), 11(2):121-137, 1979. [bib]
- A.C.C. Yao. On random 2-3 trees. Acta Informatica, 9(2):159-170, 1978. [bib]
- R.A. Baeza-Yates. Fringe analysis revisited. ACM Computing Surveys (CSUR), 27(1):109-119, 1995. [bib] [pdf]