A New Method for Fast Data Searches with Keys

@article{Litwin1987ANM,
  title={A New Method for Fast Data Searches with Keys},
  author={Witold Litwin and David B. Lomet},
  journal={IEEE Software},
  year={1987},
  volume={4},
  pages={16-24}
}
Bounded disorder uses hashing and tree indexing to speed key-associative access to data. It supports range searches and is robust, coping well with arbitrary key distributions.