Dungeons, Dragons, and Graph Databases
summary
Compares concrete SQL vs Cypher queries, shows exact statements for create read update delete and for variable‑length path matching, and demonstrates a working procedurally generated random dungeon wired into Redis Graph with JavaScript. Builds the graph model (rooms, monsters, treasures, corridors), runs longest‑path and max‑gold queries, and returns shortest routes between start and target. Code lives on GitHub and the demo runs via Docker/Redis so the examples are reproducible.
AI-written summary · about
chapters (14)
- 0:00Introduction
- 0:17Speaker intro and resources
- 1:39Optimizing D&D dungeon crawls
- 2:43What is a graph?
- 9:26Graph databases and data overlay
- 10:48Rules and structure of graph DBs
- 12:55CRUD in SQL vs graph DBs
- 19:59Creating relationships in DBs
- 22:25Querying best monsters and treasure
- 23:50Connecting rooms in DBs
- 25:56Advanced pathing queries
- 28:42Longest paths and biggest treasures
- 29:44Demo and applications
- 30:05Resources
related talks
01h 01mDungeons, Dragons, and Graph Databases
52mDungeons, Dragons, and Graph Databases
51mDungeons, Dragons, and Graph Databases.
32mGraph Databases, and Dungeons and Dragons
01h 00mWho’s Afraid of Graphs?
32mUnderstanding Complexly Connected Data using Graph Databases
49mModern Graph Databases
55mA Practical Guide to Graph Databases