Title :
A New Method for Fast Data Searches with Keys
Author :
Litwin, Witold ; Lomet, David B.
Author_Institution :
National Research Institute
fDate :
3/1/1987 12:00:00 AM
Abstract :
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.
Keywords :
Buffer storage; Computational intelligence; High performance computing;
Journal_Title :
Software, IEEE
DOI :
10.1109/MS.1987.230092
