btree-benchmark

btree-benchmark copied to clipboard

Here's another B-tree implementation to compare with. Pile nodes are limed to 3 pairs and 4 children. The search paths are fully coded with `if`/`else` jumps instead of slice loops....

pascaldekloe

``` degree=32, key=string (16 bytes), val=int64, count=1000000 ** sequential set ** google: set-seq 1,000,000 ops in 529ms, 1,889,331/sec, 529 ns/op, 56.9 MB, 59.6 bytes/op google(G): set-seq 1,000,000 ops in 378ms,...

yihuang

Shuffling after every insert set?

5

Hi, I noticed that you sort, or shuffle, the integer set after every measurement. Why so?

brurucy