Interpolation-based index maintenance

DOI10.1007/BF01934457MaRDI QIDQ1050774zbMATH OpenFDO

Authors Walter A. Burkhard

Publication date 1983

Published in BIT (Search for Journal in Brave)

zbMATH Keywords

data structureshashingrange queriesorder preservation23, 274-294 (1983)

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05) Searching and sorting (68P10)

Cites work

• scientific article; zbMATH DE number 3757684 (Why is no real title available?)
• Expected Length of the Longest Probe Sequence in Hash Code Searching
• File Organization: On the Selection of Random Access Index Points for Sequential Files
• Multidimensional binary search trees used for associative searching
• On the performance evaluation of extendible hashing and trie searching
• Organization and maintenance of large ordered indexes
• Partial-Match Retrieval Algorithms

Cited in

(9)

• Analysis of grid file algorithms
• 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
• Join strategies using data space partitioning
• Optimal dynamic multi-attribute hashing for range queries
• Optimal multiple key hashing files for orthogonal range queries
• Implementation of the grid file: Design concepts and experience
• Multidimensional quantile hashing is very efficient for nonuniform distributions
• On search by address computation

This page was built for publication: Interpolation-based index maintenance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1050774)