Big Buckets Are (Are Not) Better!

DOI10.1145/322033.322038zbMath0408.68061OpenAlexW1967291577MaRDI QIDQ4195964

Alan G. Konheim, Ian F. Blake

Publication date: 1977

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322033.322038

zbMATH Keywords

HashingInformation RetrievalInformation StorageBucketCombinatorial FunctionParking Problem

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Information storage and retrieval of data (68P20) Discrete mathematics in relation to computer science (68R99)

Related Items (6)

Parking functions for mappings ⋮ A unified approach to linear probing hashing with buckets ⋮ Components of Random Forests ⋮ Hashing techniques, a global approach ⋮ Vector parking functions with periodic boundaries and rational parking functions ⋮ Frequency loading and linear probing

This page was built for publication: Big Buckets Are (Are Not) Better!