Analysis of Early-Insertion Standard Coalesced Hashing
Wen‐Chin Chen, Jeffrey Scott Vitter · SIAM Journal on Computing · 1983
This paper analyzes the early-insertion standard coalesced hashing method (EISCH), which is a variant of the standard coalesced hashing algorithm (SCH) described in [Knu73], [Vit80] and [Vit82b]. The analysis answers the open problem posed in [Vit80]. The number of probes per successful search in full tables is 5% better with EISCH than with SCH.