[comp.lang.c] Source for extensible hashing needed

sml@beach.cis.ufl.edu (Shein-Fong Law) (06/03/90)

Summary: 
Expires: 
Sender: 
Reply-To: sml@beach.cis.ufl.edu ()
Followup-To: 
Distribution: Distribution: 
Organization: UF CIS Department
Keywords:  random access file

 I urgently need a program to store and access data records in files
using extensible hashing method.  Can you tell me where I can get it
quickly ?

Thanks in advance!

oz@yunexus.UUCP (Ozan Yigit) (06/04/90)

In article <23421@uflorida.cis.ufl.EDU> sml@beach.cis.ufl.edu (Shein-Fong Law) writes:
> I urgently need a program to store and access data records in files
>using extensible hashing method.

There are many methods of extensible hashing. Do you mean the one actually
called "extensible hashing" by Fagin et. al. or do you mean any one of
"Linear Hashing", "Dynamic Hashing", "Spiral Storage", etc. ?

>  Can you tell me where I can get it
>quickly ?

Sure, If you like, I can send you an implementation of "Dynamic Hashing",
called sdbm, which is a clone of BSD ndbm. You can also get a hold of
gdbm, which uses "Extensible Hashing". 

If you need more info on the relative merits and shortcomings of these
algorithms, see the following ref.

%A R. J. Enbody
%A H. C. Du
%T Dynamic Hashing Schemes
%J ACM Computing Surveys
%V 20
%N 2
%D June 1988
%P 85-113
%K surveys

enjoy.	oz
-- 
First learn your horn and all the theory.	Internet: oz@nexus.yorku.ca
Next develop a style. Then forget all that 	uucp: utzoo/utai!yunexus!oz
and just play.		Charlie Parker [?]	York U. CCS: (416) 736 5257

narayan@cs.iastate.edu (Pankaj Narayan) (06/04/90)

oz@yunexus.UUCP (Ozan Yigit) writes:

>In article <23421@uflorida.cis.ufl.EDU> sml@beach.cis.ufl.edu (Shein-Fong Law) writes:
>> I urgently need a program to store and access data records in files
>>using extensible hashing method.

	The latest issue of Communications of the ACM has 2 articles
	related to hashing, and I'm sure at least one of them is on
	Extensible hashing.......the algo itself is very small, and he
	proves that its elegant and has all the desirable properties
	of a *good* hashing algo.

	The issue came just 2 days back, so it must be the June 90 or
	July 90 (if they run a month ahead) issue. It has a man doing
	the tightrope atop a floppy disk as its cover picture.

	Hope this helps.




--
Pankaj Narayan                           narayan@atanasoff.cs.iastate.edu
246 North Hyland Ave, Apt. 306 ,Ames, IA 50010  Ph: (515) 292-5535