Re: Hashes from composite keys?

From: -CELKO- <jcelko212_at_earthlink.net>
Date: Wed, 28 Jul 2010 09:13:09 -0700 (PDT)
Message-ID: <64fcd81b-86a3-4922-9b13-3646c94f31a4_at_q22g2000yqm.googlegroups.com>

Google in academic sites for the research on "minimal perfect hashing"

"perfect hashing" and "databases" in the literature. It is a fairly
active area that I have not looked at in along time. But as I recall,
there was a proof that a perfect hash always exists. That mean a hash

would alway require one probe to retrieve a record from a file, unlike tree structured indexes which can require several probes. Received on Wed Jul 28 2010 - 18:13:09 CEST