On Oct 7, 2005, at 8:13 PM, David Binger wrote:
>
> On Oct 7, 2005, at 1:52 PM, mario ruggier wrote:
>
>> Hi,
>>
>> what criteria do you use for selecting the minimum degree for the
>> BNodes of a BTree?
>> Is there a simple rule of thumb?
>>
>> Do I understand correctly, that a smaller minimum degree gives:
>> -> faster writes
>> -> slower unpacked db file size growth
>> -> slower reads
>>
>> Thus, for frequent writes, and seldom reads, use smaller min degree,
>> and vice-versa ?
>
> That is probably all true, in most cases, but it depends not only on
> the
> frequency of the operations, but also on the distribution of keys used
> in
> them.

Meaning, there is generally a slowdown for all operations when the keys
are more distributed (i.e. the more nodes are touched)? And this would
be aggravated by a smaller min degree?

m.