On December 8, 2001 08:55 pm, Hans Reiser wrote:
> Daniel, you didn't mention though whether leaking collision bits is a
> problem for Htrees. Is it? Do you need to rehash every so often to
> solve it? Or it is rare enough that the performance cost can be ignored?
It's a problem of course, and I put considerable effort into handling it. I
never have to rehash because the htree isn't a hash table, it's a tree of
hash ranges. I explicitly flag every instance where a collision could force
a search to continue in a successor block. Even though it's every rare, it
does happen and it has to be handled. This is described in some detail in my
paper.
After all the effort that went into this, the result was just a few lines of
code, which was nice.
-- Daniel - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
This archive was generated by hypermail 2b29 : Sat Dec 15 2001 - 21:00:14 EST