Re: Questions concerning "Simple Components"

[Niklas Holsti <niklas.holsti@tidorum.invalid>]

On 15-11-04 04:16 , Jeremiah wrote:
> I really like a lot of the items found in the Simple Components
> library, but had a few questions on their usage.  Specifically:
>
> Generic_B_Trees have a generic package parameter "Width" which has
> the following description from the website: "Width is the size of the
> bucket of key-value pairs allocated per tree node;"
>
> This doesn't make a lot of sense to me.  I'm sure I am just missing
> something simple, but what is the "bucket" being referenced?  Is it
> terminology for how many key value pairs can be created before more
> memory has to be allocated?  The "per tree node" part also throws me
> off a little bit because on a binary tree, I would expect only one
> key/value pair per node.

B-trees are _not_ generally binary trees; the branching factor is 
typically much larger than 2. See https://en.wikipedia.org/wiki/B-tree.

I'm not familiar with the Simple Components, but the description of 
"Width"  sounds as if it sets the maximum number of key-and-value pairs 
that can be stored in one leaf node of the B-tree. The internal nodes 
also have multiple keys per node, but the corresponding values are 
pointers to child nodes, so perhaps there is a different parameter to 
set the number of key-and-pointer pairs in internal nodes.

Hopefully Dmitry will follow with a better explanation...

-- 
Niklas Holsti
Tidorum Ltd
niklas holsti tidorum fi
       .      @       .