Interpolation-based index maintenance
From MaRDI portal
Publication:1050774
DOI10.1007/BF01934457zbMath0513.68056MaRDI QIDQ1050774
Publication date: 1983
Published in: BIT (Search for Journal in Brave)
Searching and sorting (68P10) Data structures (68P05) Information storage and retrieval of data (68P20)
Related Items (9)
Optimal multiple key hashing files for orthogonal range queries ⋮ Join strategies using data space partitioning ⋮ Symbolic image indexing and retrieval by spatial similarity: An approach based on B-tree ⋮ A robust and efficient spatial data structure. The nested interpolation- based grid file ⋮ Multidimensional quantile hashing is very efficient for nonuniform distributions ⋮ Analysis of grid file algorithms ⋮ On search by address computation ⋮ Implementation of the grid file: Design concepts and experience ⋮ Optimal dynamic multi-attribute hashing for range queries
Cites Work
- Unnamed Item
- On the performance evaluation of extendible hashing and trie searching
- Organization and maintenance of large ordered indexes
- Expected Length of the Longest Probe Sequence in Hash Code Searching
- Multidimensional binary search trees used for associative searching
- File Organization: On the Selection of Random Access Index Points for Sequential Files
- Partial-Match Retrieval Algorithms
This page was built for publication: Interpolation-based index maintenance
