Smith James. Build Your Own Database From Scratch: Persistence, Indexing, Concurrency

Build-your-own.org, 2023. — 124 р.Databases are not magic. Understand them by building your own!Databases are not black boxes. Understand them by building your own from scratch! This book contains a walk-through of a minimal persistent database implementation. The implementation is incremental. We start with a B-Tree, then a simple KV store, and eventually end with a mini relational DB. The book focuses on important ideas rather than implementation details. Real-world databases are complex and harder to grasp. We can learn faster and easier from a stripped-down version of a database. And the “from scratch” method forces you to learn deeper. Although the book is short and the implementation is minimal, it aims to cover three important topics:Persistence. How not to lose or corrupt your data. Recovering from a crash.
Indexing. Efficiently querying and manipulating your data. (B-tree).
Concurrency. How to handle multiple (large number of) clients. And transactions.If you have only vague ideas like “databases store my data” or “indexes are fast”, this book is for you. This book takes a step-by-step approach. Each step builds on the previous one and adds a new concept. The book uses Golang for sample code, but the topics are language agnostic. Readers are advised to code their own version of a database rather than just read the text.Introduction
Files vs Databases
Indexing
B-Tree: The Ideas
B-Tree: The Practice (Part I)
B-Tree: The Practice (Part II)
Persist to Disk
Free List: Reusing Pages
Rows and Columns
Range Query
Secondary Index
Atomic Transactions
Concurrent Readers and Writers
Query Language: Parser
Query Language: Execution