A New Method for Fast Data Searches with Keys

Authors:
W. Litwin;D. B. Lomet
Affiliations:
National Research Institute;-
Venue:
IEEE Software
Year:
1987

Citing 0
Cited 3

Algorithms and data structures for external memory

Foundations and Trends® in Theoretical Computer Science
ISB-tree: A new indexing scheme with efficient expected behaviour

Journal of Discrete Algorithms
NEFOS: rapid cache-aware range query processing with probabilistic guarantees

DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

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.