home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.programming
- Path: sparky!uunet!cs.utexas.edu!torn!cunews!nrcnet0!bnrgate!bcrka451!bcrki65!sjm
- From: sjm@bcrki65.bnr.ca (Stuart MacMartin)
- Subject: Re: Dynamic Hashing Algorithm needed
- Message-ID: <1992Sep8.172711.3195@bcrka451.bnr.ca>
- Sender: 5E00 Corkstown News Server
- Reply-To: sjm@bcrki65.bnr.ca (Stuart MacMartin)
- Organization: Bell-Northern Research, Ottawa, Canada
- References: <dwagon.715675729@nella9.cc.monash.edu.au>
- Date: Tue, 8 Sep 1992 17:27:11 GMT
- Lines: 29
-
- In article <dwagon.715675729@nella9.cc.monash.edu.au>
- dwagon@nella9.cc.monash.edu.au (Dougal Scott) writes:
- >Does anyone have an algorithm for dynamic hashing? I remember reading about it
- >somewhere, but cannot remember where.
- >--
-
- Dynamic File Structure for Partial Match Retrieval
- Based on Overflow Bucket Sharing. Tak-Sun Yuen and David Hung-Chang Du,
- IEEE Transactions on software engineering vol. SE-12 No.8 August 1986
-
- Note: The hash value is unconstrained; the hash table uses only n bits of it
- in any overflow bucket. The full hash value of each key is held with
- the key in the overflow bucket, so you might as well use it when scanning
- overflow buckets for an exact match. This saves on expensive comparisons,
- e.g. strcpy
-
- If you need dynamically-extensible hashing on disk using little memory:
-
- University of Warwick Theory of Computation Report no.27:
- Spiral Storage: incrementally augmentable hash addressed storage
- G.N.N. Martin March 1979
-
- Hope this is what you wanted.
-
- Stuart
-
- : Stuart MacMartin email: sjm@bnr.ca :
- : Bell-Northern Research phone: (613) 763-5625 :
- : PO Box 3511, Stn C, Ottawa, K1Y-4H7, CANADA Standard disclaimers apply. :
-