Universal hash functions for an infinite universe and hash trees

Authors:
Peter Brass
Affiliations:
Department of Computer Science, City College, 138 Street at Convent Avenue, New York, USA
Venue:
Information Processing Letters
Year:
2009

Citing 10
Cited 0

Dynamic hash tables

Communications of the ACM
A caution on universal classes of hash functions

Information Processing Letters
Indexed extendible hashing

Information Processing Letters
Extendible hashing—a fast access method for dynamic files

ACM Transactions on Database Systems (TODS)
Dynamic hashing schemes

ACM Computing Surveys (CSUR)
File structures using hashing functions

Communications of the ACM
Trie hashing

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Analysis of linear hashing revisited

Nordic Journal of Computing
Virtual hashing: a dynamically changing hashing

VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
Linear hashing: a new tool for file and table addressing

VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this note we describe the adaptation of the universal hashing idea to an infinite universe, and to prefix hash trees. These are a structure underlying all extendible hash methods, which have up to now only been studied under the uniform hashing assumption.