Breaking Away from the Empire: Avoiding the Evil Clutches of If-Then Statements
summary
A concrete claim: replace nested if‑then routing code with a graph model and query it. The demo loads 2000+ planets via CSV into neo4j + Cypher, uses a shortest path query (with avoid‑node filters), returns JSON, and feeds a Streamlit + matplotlib navigator that finds routes (Tatooine appears only when certain systems are blocked), so the built app actually works and simplifies many‑to‑many logic and ranking compared to brittle SQL and nested conditionals.
AI-written summary · about
chapters (9)
- 0:00Star Wars navigation challenge
- 1:27Star Wars galaxy data
- 8:46Many-to-many with graphs
- 13:41Graphs simplify complex data
- 20:02From if-then to graph paths
- 24:23Shortest paths with Cypher
- 31:33When to use graph databases
- 35:23Importing data into Neo4j
- 40:00Q&A
related talks
32mNever use a graph database!
39mRethinking Line of Business Applications: Graphs & Cypher as an Alternative to RDBMS & SQL
01h 00mWho’s Afraid of Graphs?
38mNeo4j for Solving Graph-Based Problems
25mBuilding an Entire Graph Application with Nodestream
55mLet Me Graph That For You
49mWarming up to Graphs
29mTraversing from Zero to Production with Graphs