A small graph database built from scratch in C++, from the bytes on disk to the query language, heading towards a knowledge graph.https://smollergraph.nenuadrian.com/https://smollergraph.nenuadrian.com/ep005-buffer-pool/https://smollergraph.nenuadrian.com/ep005-buffer-pool/A buffer pool for smollerGraph, with frames, a page table, pins, dirty pages and the clock, and what it does to a million relationships.Thu, 22 Oct 2026 12:00:00 GMThttps://smollergraph.nenuadrian.com/ep004-drawing-the-graph/https://smollergraph.nenuadrian.com/ep004-drawing-the-graph/cpplint, clang-tidy and Abseil's Status for smollerGraph, then a UI, with sg serve answering HTTP and a page that draws the graph with D3, walks it a hop at a time, and shows each node's record on disk.Thu, 22 Oct 2026 12:00:00 GMThttps://smollergraph.nenuadrian.com/ep003-how-slow-is-it/https://smollergraph.nenuadrian.com/ep003-how-slow-is-it/A first benchmark on a million relationships, with the same two-hop question asked of smollerGraph, Neo4j and Kùzu.Wed, 21 Oct 2026 12:00:00 GMThttps://smollergraph.nenuadrian.com/ep002-pages-on-disk/https://smollergraph.nenuadrian.com/ep002-pages-on-disk/The graph moves from memory into files of 4 KiB pages, with fixed-size records for nodes and relationships, so it outlives the program.Wed, 21 Oct 2026 12:00:00 GMThttps://smollergraph.nenuadrian.com/ep001-graph-databases/https://smollergraph.nenuadrian.com/ep001-graph-databases/Before we build one in C++, why graphs, where the series is heading, and how Neo4j and Kùzu store a graph and run a query.Wed, 21 Oct 2026 12:00:00 GMT