~/talk

Graph Databases, and Dungeons and Dragons

Talkat JSWorld Conference USA 2021 · on Friday, 2021-05-21· [databases, web3]
slides:none on file

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

  1. 0:00Start
  2. 0:59Character Sheets
  3. 3:24What's a Graph Database
  4. 4:46Simplest Graph Database Is the Null Graph
  5. 7:18Directed Graphs
  6. 7:48Graphs Have Degrees
  7. 10:00What a Graph Database Is
  8. 14:25Crud Operations
  9. 15:46Select Statement
  10. 24:33Connect Rooms with a Relational Database
  11. 26:08Pathing Queries
  12. 30:54Practical Applications
  13. 31:33Discord Server
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.