|
| 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
| ASCII Text | x | ||
| 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. | |||
| BibTex | x | ||
| @article{ 10.1109/MS.1987.230092, author = {W. Litwin and D.B. Lomet}, title = {A New Method for Fast Data Searches with Keys}, journal ={IEEE Software}, volume = {4}, number = {2}, issn = {0740-7459}, year = {1987}, pages = {16-24}, doi = {http://doi.ieeecomputersociety.org/10.1109/MS.1987.230092}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - MGZN JO - IEEE Software TI - A New Method for Fast Data Searches with Keys IS - 2 SN - 0740-7459 SP16 EP24 EPD - 16-24 A1 - W. Litwin, A1 - D.B. Lomet, PY - 1987 KW - null VL - 4 JA - IEEE Software ER - | |||
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.