B-Trees are balanced tree data structures, used mainly in databases and operating systems.
I looked into B-Trees out of curiosity while reading about MongoDB, and then decided to prepare this workshop for our monthly get-together at Xebia.
Contents:
prez: a showoff presentation, with crappy diagrams explaining the algorithms (search, insertion, removal and bulk loading).solution: an implementation in Java. Disclaimer: the goal of this project is to understand how the algorithms work, not to provide a real-world implementation. In particular, representing keys as Java objects on the heap will probably result in poor data locality.todo: the same as above, with just the unit tests and a skeletal implementation.
The code requires Java 7, but could easily be translated for 5 or 6.