lkml.org 
[lkml]   [2008]   [Oct]   [31]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
SubjectRe: [RFC] B+Tree library
From
Date
On Fri, 2008-10-31 at 13:54 +0100, Jörn Engel wrote:
> 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.

OTOH, there is no need to put the SSID in if I put a small list into
each node, effectively using the tree instead of the hash table and then
disambiguating the unlikely case of multiple SSID in a list.

> 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.

:)

johannes
[unhandled content-type:application/pgp-signature]
\
 
 \ /
  Last update: 2008-10-31 14:09    [from the cache]
©2003-2011 Jasper Spaans