Analysis of Extendible Hashing

DOI10.1109/TSE.1982.236022MaRDI QIDQ3953217zbMATH OpenFDO

Authors Haim Mendelson

Publication date 1982

Published in IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSE.1982.236022

zbMATH Keywords

database designextendible hashingperformance analysis

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Cited in

(12)

• Analysis of grid file algorithms
• Lattice path combinatorics and linear probing
• On permutations with limited repetition
• An approximate analysis of the performance of extendible hashing with elastic buckets
• On the distribution for the duration of a randomized leader election algorithm
• Laws of large numbers and tail inequalities for random tries and PATRICIA trees
• How many random questions are necessary to identify n distinct objects?
• Expected worst-case partial match in random quadtries
• An analytic approach to the asymptotic variance of trie statistics and related structures
• Analysis of random LC tries
• A note on the probabilistic analysis of patricia trees
• Smoothed heights of tries and patricia tries

This page was built for publication: Analysis of Extendible Hashing

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