|Hash tables firstname.lastname@example.org (2004-10-02)|
|Re: Hash tables email@example.com (2004-10-02)|
|Re: Hash tables firstname.lastname@example.org (C) (2004-10-02)|
|Re: Hash tables email@example.com (2004-10-04)|
|Re: Hash tables firstname.lastname@example.org (John Slimick) (2004-10-04)|
|From:||email@example.com (Victor Eijkhout)|
|Date:||2 Oct 2004 01:16:30 -0400|
|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?
Return to the
Search the comp.compilers archives again.