DocumentCode
1211872
Title
A New Method for Fast Data Searches with Keys
Author
Litwin, Witold ; Lomet, David B.
Author_Institution
National Research Institute
Volume
4
Issue
2
fYear
1987
fDate
3/1/1987 12:00:00 AM
Firstpage
16
Lastpage
24
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;
fLanguage
English
Journal_Title
Software, IEEE
Publisher
ieee
ISSN
0740-7459
Type
jour
DOI
10.1109/MS.1987.230092
Filename
1695706
Link To Document