Messages in this thread | | | Date | Thu, 06 Dec 2001 16:44:57 +0300 | From | Hans Reiser <> | Subject | Re: Ext2 directory index: ALS paper and benchmarks |
| |
Daniel Phillips wrote:
>On December 6, 2001 04:56 am, Hans Reiser wrote: > >>>On December 6, 2001 04:41 am, you wrote: >>> >>>>ReiserFS is an Htree by your definition in your paper, yes? >>>> >>>You've got a hash-keyed b*tree over there. The htree is fixed depth. >>> >>B*trees are fixed depth. B-tree usually means height-balanced. >> > >I was relying on definitions like this: > > B*-tree > > (data structure) > > Definition: A B-tree in which nodes are kept 2/3 full by redistributing > keys to fill two child nodes, then splitting them into three nodes. >
This is the strangest definition I have read. Where'd you get it?
> > >To tell the truth, I haven't read your code that closely, sorry, but I got >the impression that you're doing rotations for balancing no? If not then >
What are rotations?
> >have you really got a b*tree? > >-- >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/
| |