A log log n Data Structure for Three-Sided Range Queries.
Otfried FriesKurt MehlhornStefan NäherAthanasios K. TsakalidisPublished in: Inf. Process. Lett. (1987)
Keyphrases
- range queries
- data structure
- external memory
- index structure
- additive error
- r tree
- multidimensional data
- worst case
- multi dimensional
- efficient processing
- lower bound
- main memory
- metric space
- asymptotically optimal
- range searching
- declustering schemes
- b tree
- query processing
- disk accesses
- similarity queries
- knn
- range query processing
- locality sensitive hashing
- space efficient
- suffix tree
- indexing techniques
- tree structure
- neural network
- memory space
- multi dimensional data
- response time
- nearest neighbor
- upper bound
- databases