On: Static B-Trees: A data structure for faster binary search

[sereja]

I've already implemented a 32-byte version. But, as mentioned in the article, it's not faster (in terms of throughput) because it needs to fetch two cache lines.