Interpolation-based index maintenance

DOI10.1007/BF01934457zbMath0513.68056MaRDI QIDQ1050774

Walter A. Burkhard

Publication date: 1983

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

data structures; hashing; range queries; order preservation; 23, 274-294 (1983)

Mathematics Subject Classification ID

68P10: Searching and sorting

68P05: Data structures

68P20: Information storage and retrieval of data

Related Items

On search by address computation, Analysis of grid file algorithms, Implementation of the grid file: Design concepts and experience, Join strategies using data space partitioning, A robust and efficient spatial data structure. The nested interpolation- based grid file, Optimal dynamic multi-attribute hashing for range queries, Optimal multiple key hashing files for orthogonal range queries, Multidimensional quantile hashing is very efficient for nonuniform distributions, Symbolic image indexing and retrieval by spatial similarity: An approach based on B-tree

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