public inbox for linux-kernel@vger.kernel.org
 help / color / mirror / Atom feed
* "fuzzy hashing" = skiplists in a different shape
@ 1998-08-28  9:06 Patrik Hagglund
  1998-08-28 21:06 ` David S. Miller
  0 siblings, 1 reply; 2+ messages in thread
From: Patrik Hagglund @ 1998-08-28  9:06 UTC (permalink / raw)
  To: davem; +Cc: linux-kernel

I saw your "fuzzy hashing" implementation on Linux Weekly News
yesterday, and to me it looks much like randomized skip list. The
neigbour_next list is the first level pointer chain and hash_next is
the second level. But, there is a notable exception. Your code
contians 16 second-level lists, that is, 15 redundant ones.

> it will be as fast or cheaper _even_ in the common case than what we
> have now

? What is this common case. I can't see how your implementation would
be faster than a good implementation of a balanced search tree.

Regards,
Patrik Hägglund,
intrested in data structures and algorithms,
but not a kernel hacker (yet)

-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.rutgers.edu
Please read the FAQ at http://www.altern.org/andrebalsa/doc/lkml-faq.html

^ permalink raw reply	[flat|nested] 2+ messages in thread

end of thread, other threads:[~1998-08-28 21:53 UTC | newest]

Thread overview: 2+ messages (download: mbox.gz follow: Atom feed
-- links below jump to the message on this page --
1998-08-28  9:06 "fuzzy hashing" = skiplists in a different shape Patrik Hagglund
1998-08-28 21:06 ` David S. Miller

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox