What would happen if you combine the query performance of a B+ tree, the write performance of an append-only log and the convenience of a functional, persistent data structure? You’d get David Greenberg’s hitchhiker tree! (5 pages)
If you’re having trouble viewing above, you can also download the PDF (~10MB).
If you like what you’ve read, join us and receive future digital issues for FREE. Click on the button below!