A tryst with B+Trees: Part I
Previous Post: A naive implementation of file-based storage It was impossible to not come across B-Trees or any of the variants (B+Trees) if I had to implement a database. I hadn’t studied this data structure before. Understanding the use case At its core, B-Trees are multilevel indices for data stored in a database. A good … [Read more…]