Some recursive constructions for perfect hash families

Abstract

An (n, m, w)-perfect hash family is a set of functions F such that for each f ϵ F, and for any X ⊆ {1,…,n} such that |X| = w, there exists at least one f ϵ F such that f|x is one-to-one. Perfect hash families have been extensively studied by computer scientists for over 15 years, mainly due to their applications in database management. In particular, much attention has been given to finding efficient algorithms to construct perfect hash families. In this article, we study perfect hash families from a combinatorial viewpoint, and describe some new recursive constructions for these objects. © 1996 John Wiley & Sons, Inc.