Static search trees: faster than binary search(curiouscoding.nl)
585 points by atombender | 196 comments
A long blog post by Ragnar Groot Koerkamp implementing and optimizing a static S+ search tree for high-throughput sorted-data search, reaching up to 40x faster than binary search.



