How graph databases work: Neo4j and Kùzu | Building smollerGraph #1

We start a series that builds smollerGraph, a small graph database, from scratch in C++, heading towards a knowledge graph that mvGPT can ask for facts. Before writing any code, we look at the property graph model, why following relationships beats joining tables for queries that walk many hops, and Cypher, on a small graph about animals. Then we run a food chain query on Neo4j and Kùzu, compare how each of them keeps its graph, and write a first graph in C++, kept in memory, with a walk down the food chain and GoogleTest tests. The series: https://smollergraph.nenuadrian.com The code: https://github.com/nenuadrian/smoller... The playlist:    • Building A Graph Database from Scratch (sm...   Chapters: 0:00 Intro 1:36 Why graphs 3:02 Towards a knowledge graph 3:54 What a graph database is 5:08 Cypher 5:50 Neo4j 7:35 Kùzu 9:23 Side by side 10:00 Where to go deeper 10:42 What smollerGraph could be 11:32 The plan 12:24 A throwaway graph in C++ 15:01 Nodes and relationships 20:19 Facts from a file 24:59 Walking the graph 28:17 Tests 31:46 Wrap-up Music: Viacheslav Starostin (https://pixabay.com/users/starostin-4..., from Pixabay #database #graphdatabase #knowledgegraph