Benchmark BTree and make performance improvements
Opened this issue · 0 comments
davidbalbert commented
Ideas:
- Store Node.children in a fixed-size array (defined in C) to avoid extra pointer chasing
- Add Node.summaries to store summaries of each child (for better data locality).
- Store the Chunk's string contents in a fixed-sized array (defined in C) to avoid pointer chasing.