Re: [RFC] B+Tree library

["Jörn Engel" <joern@logfs.org>]

On Fri, 31 October 2008 12:32:41 +0100, Johannes Berg wrote:
> > > 
> > > Would there be an easy way to use 48-bit keys? Or variable length keys?
> > 
> > Variable as in one implementation for several trees with different
> > sizes, yes.  Variable as in one tree with differently sized keys, no.
> 
> Ok, I guess that would blow up the key size to 6+1+32 bytes, or 10 (5)
> longs. Bit large.

Yes.  Insanely large keys are a good indication to better avoid btrees.

> > > I think the wireless case would probably want to have real shrinking
> > > because it's well possible that you're moving, with your laptop, from an
> > > area with a large number of APs to say your home out in the countryside
> > > that only has your single AP.
> > 
> > Indeed.
> 
> I guess not then for now, unless one of us wants to implement
> resizing... I'll look for replacements another time, nobody has
> complained yet about the huge hash table :)

I actually have something that compiles now.  It still needs a bit of
water and soap before I'd consider it presentable, but turned out to be
less complicated than expected.

Jörn

-- 
More computing sins are committed in the name of efficiency (without
necessarily achieving it) than for any other single reason - including
blind stupidity.
-- W. A. Wulf