tune b+tree values

Did some benchmarking with b+tree values. The actual interactions
appear to be slightly inconsistent; some values seem to help more
in cases with higher OpN in benchmarks, others with lower OpN. It
appears that the practical consideration may be what happens
when a snapshot gets triggered; smaller kx/kd appear to reduce
costs there, but increase costs between snapshots. This is a
bit of guesswork.

Numbers are slighly under powers of 2, because that means that the
total actual sizes of k and d end up fitting nicely in alloc
pool sizes.
This commit is contained in:
Seebs 2019-03-26 15:55:33 -05:00
parent 71e7f62909
commit aab42e97a4

View file

@ -38,9 +38,9 @@ import (
const (
// kx must be >= 2
kx = 128 //TODO benchmark tune this number if using custom key/value type(s).
kx = 126 //TODO benchmark tune this number if using custom key/value type(s).
// kd must be >= 1
kd = 128 //TODO benchmark tune this number if using custom key/value type(s).
kd = 254 //TODO benchmark tune this number if using custom key/value type(s).
)
var (