* "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
* Re: "fuzzy hashing" = skiplists in a different shape
1998-08-28 9:06 "fuzzy hashing" = skiplists in a different shape Patrik Hagglund
@ 1998-08-28 21:06 ` David S. Miller
0 siblings, 0 replies; 2+ messages in thread
From: David S. Miller @ 1998-08-28 21:06 UTC (permalink / raw)
To: patha; +Cc: linux-kernel
Date: Fri, 28 Aug 1998 11:06:33 +0200
From: Patrik Hagglund <patha@ida.liu.se>
? What is this common case. I can't see how your implementation would
be faster than a good implementation of a balanced search tree.
You said the answer, I don't have to balance anything, so
insert/delete don't cost so much like trees requiring balancing do.
I would suggest that people run through some examples, ie. take
/proc/{pid}/maps for some large process with many attachments, like
emacs or something, have a little test program setup the data
structures as if vma_insert was called in sequence for each vma, and
then pick arbitrary addresses and see what find_vma() does and how
quickly it finds the answer.
Or just print little ascii visualiziations from your test program and
try to figure out for yourself with the picture it outputs why it is
so impressive an algorithm and why it kicks the shit out of any tree
based solution for this class of problems.
Later,
David S. Miller
davem@dm.cobaltmicro.com
-
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