Adaptive hashing

摘要

Adaptive hashing is a new file processing scheme which combines the organization of a B+-Tree with the operational algorithms of order-preserving linear hashing, and in so doing, it fully utilizes the advantages of both. Its performance, which can be controlled by a single parameter, is stable under all circumstances. Its storage utilization is nearly 80% at any time under any circumstances. No other file organization or algorithms are known which attain such stable and predictable performance.