Graph databases
On This Lesson 4 topics
This lesson is planned. The outline below lists the topics it will cover. The full lesson has not been published yet.
In this lesson
recognise relationship-heavy problems.
Planned topics
- Data is nodes and edges with properties (Neo4j, query language Cypher).
- Strong when queries traverse many hops: recommendations, fraud rings, social graphs.
- The same question in SQL needs many joins that get slower with depth.
- Weak for bulk analytics and simple key lookups; scaling out is harder than for key-value stores.
Draft outline details
Demonstration
(Customer)-[:BOUGHT]->(Product)<-[:BOUGHT]-(Other)-[:BOUGHT]->(Rec): "customers who bought this also bought".
Check your understanding
When does a graph store beat SQL?
Show answer
Deep multi-hop relationship queries.
Practice
Apply this lesson with the module's lab, exercises and quiz.
Marking a lesson complete is optional and you can undo it any time. Your progress stays in this browser.