A dynamic storage allocation algorithm suitable for file structures
- 1 January 1990
- journal article
- Published by Elsevier in Information Systems
- Vol. 15 (5) , 515-521
- https://doi.org/10.1016/0306-4379(90)90024-j
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Performance of B/sup +/-trees with partial expansionsIEEE Transactions on Knowledge and Data Engineering, 1989
- Expected behaviour of B+-trees under random insertionsActa Informatica, 1989
- A simple bounded disorder file organization with good performanceACM Transactions on Database Systems, 1988
- Partial expansions for file organizations with an indexACM Transactions on Database Systems, 1987
- An Introduction to Combinatorial Models of Dynamic Storage AllocationSIAM Review, 1983
- Ubiquitous B-TreeACM Computing Surveys, 1979
- Bounds for Some Functions Concerning Dynamic Storage AllocationJournal of the ACM, 1974
- A dynamic storage allocation problemInformation Processing Letters, 1973
- An Estimate of the Store Size Necessary for Dynamic Storage AllocationJournal of the ACM, 1971