B + trees, bounded disorder and adaptive hashing

Abstract

For many years, the B + tree has been the file structure of choice for applications requiring both sequential and direct access. However, two file structures developed recently for similar applications, bounded disorder file organization and adaptive hashing, may offer improvements. Are they better? In what ways? When should they be used? To answer these and related questions, this correspondence summarizes the performance characteristics, implementation aspects, and use considerations for these three file structures. For many circumstances, one of the newer techniques is preferable to the B + tree.