Issue No. 02 - March/April (1987 vol. 4)
W. Litwin , National Research Institute
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.
D. Lomet and W. Litwin, "A New Method for Fast Data Searches with Keys," in IEEE Software, vol. 4, no. , pp. 16-24, 1987.