Hash tables

victor@eijkhout.net (Victor Eijkhout)
2 Oct 2004 01:16:30 -0400

          From comp.compilers

Related articles
Hash tables victor@eijkhout.net (2004-10-02)
Re: Hash tables nmm1@cus.cam.ac.uk (2004-10-02)
Re: Hash tables cc-news@hermes.mirlex.com (C) (2004-10-02)
Re: Hash tables vbdis@aol.com (2004-10-04)
Re: Hash tables slimick@venango.upb.pitt.edu (John Slimick) (2004-10-04)
| List of all articles for this month |

From: victor@eijkhout.net (Victor Eijkhout)
Newsgroups: comp.compilers
Date: 2 Oct 2004 01:16:30 -0400
Organization: *prffft*
Keywords: question, storage
Posted-Date: 02 Oct 2004 01:16:30 EDT

Knuth (AoCP 6.4) more or less waves away the `open hashing' strategy,
where you resolve conflicts by allocating a linked list outside the hash
table. He devotes almost all of that section to `closed hashing',
investigating linear probing and chaining as ways of storing the
conflicting items elsewhere in the table.

Personally, I don't see the problem with open hashing.

So, was closed hashing born of necessity in the days when memory was at
a premium and you needed to keep track of every last byte yourself?

What's used these days?


Post a followup to this message

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