Thinking in Graphs – An Intro to Graph Databases & Applications
summary
Starts from Euler's seven‑bridges puzzle and states the concrete theorem used (sum of vertex degrees = 2×edges, Euler trails require all but 0 or 2 vertices even). Demonstrates live examples on Neo4j desktop, runs Cypher and Gremlin queries, highlights libraries like APOC procedures and mentions Python options (NetworkX). Points out a super node >10,000 as an influencer pattern, lists concrete applications (shortest‑path routing, fraud rings via transitive links) and shows Kevin Bacon reachable in three hops.
AI-written summary · about
chapters (7)
- 0:00Origins of graph theory
- 3:16Key graph concepts
- 13:15Graph in real-world networks
- 18:57Evolution of data processing
- 21:51Graph database applications
- 24:42Demo of Neo4j queries
- 27:15Q&A and resources
related talks
13mManaging Connections with Graphs: Uses and Challenges
19mUnraveling the Web of Relationships: Understanding Graph Data
55mA Practical Guide to Graph Databases- 19mUnraveling the Web of Relationships: Understanding Graph Data
32mUnderstanding Complexly Connected Data using Graph Databases
55mLet Me Graph That For You
46mGraph Databases: Talking about your Data Relationships with Python
49mModern Graph Databases