Managing Connections with Graphs: Uses and Challenges
summary
Graphs reduce Euler’s seven-bridges puzzle to vertex degrees and prove no walk exists when four vertices have odd degree, showing concrete math behind the claim. Discusses concrete tools: recommends neo4j for getting started, cites a new system claiming 100 billion vertices, and describes building GraphFlow to run continuous queries that incrementally emit new or deleted triangles. Lists real limitations: scalability, visualization, and competing query languages, and gives examples of shortest paths, neighborhood, and subgraph pattern queries.
AI-written summary · about
chapters (11)
- 0:00Intro
- 0:12Once upon a time
- 1:22Graph!
- 2:15Graphs, Graphs Everywhere!
- 3:21Common Graph Computations
- 4:35Thinking in terms of graphs
- 7:05Key Challenges
- 9:08Behold the future!
- 11:06One-Time Queries
- 11:31Continuous Queries
- 12:47Eulerian Walk
related talks
29mThinking in Graphs – An Intro to Graph Databases & Applications
19mUnraveling the Web of Relationships: Understanding Graph Data
43mGraphs are Everywhere- 19mUnraveling the Web of Relationships: Understanding Graph Data
- 19mUnraveling the Web of Relationships: Understanding Graph Data
32mUnderstanding Complexly Connected Data using Graph Databases
55mLet Me Graph That For You
49mWarming up to Graphs