Graph Databases, and Dungeons and Dragons
summary
Maps a Dungeons & Dragons dungeon into a graph and shows concrete queries that find optimal routes and loot using RedisGraph and Cypher. The claim is that relationship and path queries become simpler and more expressive than equivalent SQL joins; examples include pattern matching with variable-length hops to list nearby rooms, compute shortest path to the biggest treasure, aggregate max gold, and order monsters by XP. Queries are shown end-to-end and return the expected paths and aggregates; demo is skipped for time.
AI-written summary · about
chapters (13)
- 0:00Start
- 0:59Character Sheets
- 3:24What's a Graph Database
- 4:46Simplest Graph Database Is the Null Graph
- 7:18Directed Graphs
- 7:48Graphs Have Degrees
- 10:00What a Graph Database Is
- 14:25Crud Operations
- 15:46Select Statement
- 24:33Connect Rooms with a Relational Database
- 26:08Pathing Queries
- 30:54Practical Applications
- 31:33Discord Server
related talks
31mDungeons, Dragons, and Graph Databases
01h 01mDungeons, Dragons, and Graph Databases
52mDungeons, Dragons, and Graph Databases
51mDungeons, Dragons, and Graph Databases.
19mUnraveling the Web of Relationships: Understanding Graph Data
26mGraph Databases will change your (freakin') life
32mUnderstanding Complexly Connected Data using Graph Databases
55mA Practical Guide to Graph Databases
