An approximate analysis of the performance of extendible hashing with elastic buckets
References (12)
More birthday surprises
J. Combin. Theory
(1969)- et al.
Extensions of the birthday surprise
J. Combin. Theory
(1967) A note on the analysis of extendible hashing
Inform. Process. Lett.
(1980)- et al.
B+-Trees with partial expansions
IEEE Trans. Knowledge Data Eng.
(1989) - et al.
Extendible hashing - A fast access method for dynamic files
ACM Trans. Database Systems
(1979) On the performance evaluation of extendible hashing and trie searching
Acta Inform.
(1983)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 1993 Published by Elsevier B.V.