A dynamic storage allocation algorithm suitable for file structures

摘要

We derive a practical algorithm for dynamic storage allocation based on a theoretical result. We apply this algorithm to disk storage allocation of B+-trees with partial expansions. Simulation results show that this algorithm provides very low external fragmentation. This technique can also be used in linear hashing or bounded disorder files.