Computing the probability of hash table/urn overflow

DOI10.1080/03610928708829574zbMath0639.68127OpenAlexW2033094568MaRDI QIDQ3780513

M. V. Ramakrishna

Publication date: 1987

Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610928708829574

zbMATH Keywords

perfect hashingclassical occupancy problemballs and urns modelcombinatorial extreme- value distribution

Mathematics Subject Classification ID

Combinatorial probability (60C05) Information storage and retrieval of data (68P20)

Related Items (6)

Bounded disorder: The effect of the index ⋮ Analysis of bounded disorder ⋮ Performance analysis of file organizations that use multi-bucket data leaves ⋮ Analysis of random probing hashing ⋮ An approximate analysis of the performance of extendible hashing with elastic buckets ⋮ Asymptotics of the overflow in urn models

Cites Work

• Analysis of Uniform Hashing
• Combinatorial extreme value distributions
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing the probability of hash table/urn overflow