This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Method for Fast Data Searches with Keys
March/April 1987 (vol. 4 no. 2)
pp. 16-24
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.
Citation:
W. Litwin, D.B. Lomet, "A New Method for Fast Data Searches with Keys," IEEE Software, vol. 4, no. 2, pp. 16-24, March-April 1987, doi:10.1109/MS.1987.230092
Usage of this product signifies your acceptance of the Terms of Use.