The Community for Technology Leaders
Green Image
Issue No. 02 - March/April (1987 vol. 4)
ISSN: 0740-7459
pp: 16-24
W. Litwin , National Research Institute
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.
INDEX TERMS
null
CITATION
D.B. Lomet, W. Litwin, "A New Method for Fast Data Searches with Keys", IEEE Software, vol. 4, no. , pp. 16-24, March/April 1987, doi:10.1109/MS.1987.230092
107 ms
(Ver )