Graphs & gremlins

on YouTube ↗38m

" summary

Claims that graph databases (using OrientDB, gremlin-scala) let you keep relational features while gaining much faster traversals through index-free adjacency. Shows a runnable Scala demo on GitHub that builds an email/person graph, runs Gremlin traversals to list CCs, find bankers linked to government officials within two hops, run community detection with TinkerPop/Furnace and compute shortest paths. Targets small-to-medium apps, uses scala-blueprints/blueprints for mapping, and reports the approach works well in practice.

AI-written summary · about

" chapters (7)

1. 0:00Start
2. 0:24Graph Databases
3. 17:33Mutual Edges
4. 18:49Relational Model
5. 20:51How It Differs in a Graph Databases
6. 29:04Finding the Shortest Path
7. 33:41Combine a Postgres Database with a Graph Database

" related talks

• 49mModern Graph DatabasesDavid Ostrovsky · Build Stuff 2025
• 01h 00mWho’s Afraid of Graphs?David Ostrovsky · Build Stuff 2017
• 41mGraphGen: Conducting Graph Analytics over Relational DatabasesKonstantinos Xirogiannopoulos · PyData DC 2016
• 37mType safety in the world of graph databasesMichael Pollmeier · Scala Days Berlin 2018
• 01h 01mA Skeptics Guide to Graph DatabasesDavid Bechberger · NDC Oslo 2019
• 55mA Practical Guide to Graph DatabasesDavid Bechberger · NDC Oslo 2018
• 37mGraph Computing at ScaleMatthias Broecheler · Strange Loop 2013
• 19mUnraveling the Web of Relationships: Understanding Graph DataMala Mahadevan · SQLBits 2024