Who’s Afraid of Graphs?
summary
Cuts through what graph databases actually do: stores vertices/edges, runs fast in-memory traversals, and fails to shard easily because partitioning is NP‑hard. Demonstrations use Neo4j/Cypher, OrientDB’s SQL-ish expand, Gremlin and Cosmos DB; a live movie recommendation demo builds 3‑step traversals for top titles, a permissions model replaces costly joins, and a Path of Exile scraper computes currency arbitrage paths that boosted returns from ~900 to ~1,600 alteration orbs. Elasticsearch Graph API turns tweets into weighted word graphs and sentiment clusters. Performance hinges on memory, replication and query routing.
AI-written summary · about
chapters (15)
- 0:00Start
- 0:59Leonard Euler
- 5:34Security Permissions
- 7:43Multi Model Database
- 9:34How Do You Query Your Data
- 11:35Sample Database
- 13:03Match Query
- 13:37Mel Brooks
- 26:41Gremlin
- 28:30Orion Db Example
- 31:47Neo4j
- 35:30How Do You Express a Permission System on Top of a Graph
- 41:49Path of Exile
- 48:45Time Dimension
- 57:08Performance
related talks
49mModern Graph Databases
41mWho’s Afraid of Graphs
32mUnderstanding Complexly Connected Data using Graph Databases
56mWhat are Graph Databases and Why should I care?
55mA Practical Guide to Graph Databases
01h 01mA Skeptics Guide to Graph Databases
52mDungeons, Dragons, and Graph Databases
32mNever use a graph database!