Expected behaviour of B+-trees under random insertions
- 1 March 1989
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 26 (5), 439-471
- https://doi.org/10.1007/bf00289146
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- An empirical comparison of B-trees, compact B-trees and multiway treesACM SIGMOD Record, 1984
- Storage utilization in B *-trees with a generalized overflow techniqueActa Informatica, 1983
- The theory of fringe analysis and its application to 23 trees and b-treesInformation and Control, 1982
- Kantorovich-Type InequalitiesThe American Mathematical Monthly, 1982
- Dense multiway treesACM Transactions on Database Systems, 1981
- Some observations on random 2–3 treesInformation Processing Letters, 1979
- Ubiquitous B-TreeACM Computing Surveys, 1979
- Prefix B -treesACM Transactions on Database Systems, 1977
- Organization and maintenance of large ordered indexesActa Informatica, 1972
- Binary B-trees for virtual memoryPublished by Association for Computing Machinery (ACM) ,1971