Re: Hash specifics

brain@eos.ncsu.edu (Marshall Brain)
Tue, 18 Dec 90 21:51:49 GMT

          From comp.compilers
Related articles
[10 earlier articles]
Re: Hash specifics roth@resi.rice.edu (1990-12-14)
Re: Hash specifics oz@nexus.yorku.ca (1990-12-14)
Re: Hash specifics plx!plxsun!evan@Sun.COM (1990-12-15)
Re: Hash specifics vern@horse.ee.lbl.gov (1990-12-16)
Re: Hash specifics schmidt@oberkampf.ICS.UCI.EDU (Doug Schmidt) (1990-12-17)
Re: Hash specifics preston@ariel.rice.edu (1990-12-17)
Re: Hash specifics brain@eos.ncsu.edu (1990-12-18)
Re: Hash specifics rfpfeifl@watcgl.uwaterloo.ca (Ron Pfeifle) (1990-12-21)
| List of all articles for this month |
Newsgroups: comp.compilers
From: brain@eos.ncsu.edu (Marshall Brain)
Keywords: design
Organization: North Carolina State University
References: <9012111913.AA07310@cs-sun-fsa.cpsc.ucalgary.ca>
Date: Tue, 18 Dec 90 21:51:49 GMT

Cichelli's work in Perfect Hashing was extended in the paper:


"Near-Perfect Hashing of Large Word Sets", by Brain and Tharp,
Software - Practice and Experience, Vol. 19, No. 10 (October 1989)
pp. 967-978.


This algorithm could handle around 1000 words. An extremely simple algorithm,
also based on Cichelli's work and able to handle up to 5000 or so words
appeared in the paper:


"Perfect Hashing Using Sparse Matrix Packing", by Brain and Tharp,
Information Systems, Vol. 15, No. 3 (1990), pp. 281-290.
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.