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…]
Previous Post: YetiDB: an academic exercise We have a basic implementation of four interfaces— The core idea is to have the interfaces defined and write a number of good test cases. This will help me when I get to serious implementations of db engines. Implementation From an implementation standpoint, the Query Parser is rudimentary and … [Read more…]
Over the last couple of years I have seen protobufs being used not only as a means to serialize and deserialize data for transport over network but also as a means to implement a type system, business logic, version control, storage schema, and what not. These often require authoring some sort of custom options (extensions) for the … [Read more…]
