Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. R. Bayer, E. McCreight: Organization and maintenance of large ordered indexes. Acta Informatica 1,173–189(1972).
2. R. Bayer: Symmetric binary B-Trees: data structure and maintenance algorithms. Acta Informatica 1,290–306(1972).
3. R. Bayer, M. Schkolnick: Concurrency of operations on B-Trees. IBM Res. Report R5 1791 (May 1976), and Acta Informatica 9, 1–21 (1977).
4. R. Bayer, K. Unterauer: Prefix B-Trees. TODS 2, 11–26 (1977), ACM.
5. D. Comer: The ubiquitous B-Tree: Computing Surveys 11,121–137 (1979).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Revisiting B-Trees;Advances in Computing and Communications;2011