Dimensioning a multiple hashing scheme

DOI10.2307/3215386zbMATH Open0895.60007OpenAlexW2324429706MaRDI QIDQ4358596FDOQ4358596

Authors: A. D. Barbour, Ravindra M. Phatarfod 

Publication date: 1 October 1997

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3215386

Recommendations

• Optimal information retrieval when queries are not random
• Multidimensional quantile hashing is very efficient for nonuniform distributions
• Space/time trade-offs in hash coding with allowable errors
• Multi-directory hashing
• Collections of Functions for Perfect Hashing

zbMATH Keywords

data storagemultiple hashing scheme

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Approximations to statistical distributions (nonasymptotic) (62E17) Combinatorial probability (60C05)

Cited In (2)

• A new multivariate hash algorithm based on an improved Merkle-Damgård construction
• Double hashing with passbits

This page was built for publication: Dimensioning a multiple hashing scheme

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