Computing the probability of hash table/urn overflow

DOI10.1080/03610928708829574MaRDI QIDQ3780513zbMATH OpenOpenAlexFDO

Authors 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

balls and urns modelclassical occupancy problemcombinatorial extreme- value distributionperfect hashing

Mathematics Subject Classification ID

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

Recommendations

• On probabilistic analysis of a coalesced hashing algorithm
• Collections of Functions for Perfect Hashing
• The analysis of double hashing
• Analysis of random probing hashing
• Analysis of hashing with chaining in the prime area

Cites work

• Analysis of Uniform Hashing
• Combinatorial extreme value distributions
• scientific article; zbMATH DE number 3586221 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)

Cited in

(6)

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

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

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