Path: utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!apple!bionet!agate!e260-3b!laba-3ec
From: laba-3ec@e260-3b.berkeley.edu (Adrian J Ho)
Newsgroups: comp.lang.misc
Subject: Adaptive perfect hashing -- the sequel
Summary: Finally, another reference!
Keywords: adaptive perfect hashing sequel
Message-ID: <1990Feb28.044203.8694@agate.berkeley.edu>
Date: 28 Feb 90 04:42:03 GMT
References: <3442@caesar.cs.montana.edu>
Sender: adrianho@cory.berkeley.edu (Adrian J Ho)
Reply-To: adrianho@cory.Berkeley.EDU. (Adrian J Ho)
Distribution: usa
Organization: University of California, Berkeley
Lines: 14

Finally found another reference on adaptive perfect hashing (sort of).
Wonder why I didn't look here first:

"File Organization Using Composite Perfect Hashing"
Ramakrishna & Larson, ACM Transactions on Database Systems, June 1989, p.231

The algorithm described was designed for a database systems, but I see no
reason why it can't be adapted for main memory usage.  I've just started
reading the paper, but things look very promising.

-----------------------------------------------------------------------------
Adrian J Ho					   adrianho@cory.berkeley.edu
University of California, Berkeley		   adrianho@soda.berkeley.edu
						        ajho@ocf.berkeley.edu