mirror of
https://github.com/featurebasedb/featurebase.git
synced 2026-08-28 10:54:59 +00:00
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. |
||
|---|---|---|
| .. | ||
| testdata | ||
| btree.go | ||
| container_stash.go | ||
| containers.go | ||
| containers_btree.go | ||
| containers_test.go | ||
| roaring.go | ||
| roaring_helpers_test.go | ||
| roaring_internal_test.go | ||
| roaring_nop_paranoia.go | ||
| roaring_nop_stats.go | ||
| roaring_paranoia.go | ||
| roaring_stats.go | ||
| roaring_test.go | ||