Multidimensional quantile hashing is very efficient for nonuniform distributions

DOI10.1016/0020-0255(89)90014-5MaRDI QIDQ1824378zbMATH OpenOpenAlexFDO

Authors Hans-Peter Kriegel, Bernhard Seeger

Publication date 1989

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0255(89)90014-5

zbMATH Keywords

multidimensional hashing schemesmultidimensional quantile hashing

Mathematics Subject Classification ID

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

Recommendations

• Binary Multidimensional Scaling for Hashing
• Hashing with Linear Probing under Nonuniform Probabilities
• Fast hashing with strong concentration bounds
• Data-dependent hashing via nonlinear spectral gaps
• Quasi-perfect Hashing
• Hashing on Nonlinear Manifolds
• Optimal data-dependent hashing for approximate near neighbors
• Fast and simple compact hashing via bucketing
• Fast and simple compact hashing via bucketing

Cites work

• A robust and efficient spatial data structure. The nested interpolation- based grid file
• A Stochastic Approximation Method
• A storage scheme for extendible arrays
• Analysis of grid file algorithms
• scientific article; zbMATH DE number 3704354 (Why is no real title available?)
• Interpolation-based index maintenance
• The extendible cell method for closest point problems

Cited in

(4)

• Non-expansive hashing
• scientific article; zbMATH DE number 1256770 (Why is no real title available?)
• Dimensioning a multiple hashing scheme
• Multi-directory hashing

This page was built for publication: Multidimensional quantile hashing is very efficient for nonuniform distributions

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