Graph Databases: Building Connected Data Applications with Neo4j

In This Guide

• 1. When Relational Databases Struggle with Relationships
• 2. Graph Database Concepts — Nodes, Edges, Properties
• 3. Neo4j — Cypher Query Language
• 4. Real-World Use Cases
• 5. Neo4j vs Alternatives
• 6. When NOT to Use a Graph Database
• 7. Frequently Asked Questions

The JOIN Problem

-- SQL: "Find friends of friends who bought the same product"
-- This is already painful at 2 hops...
SELECT DISTINCT f2.name
FROM users u
JOIN friendships f1 ON u.id = f1.user_id
JOIN users friend ON f1.friend_id = friend.id
JOIN friendships f2_link ON friend.id = f2_link.user_id
JOIN users f2 ON f2_link.friend_id = f2.id
JOIN purchases p1 ON u.id = p1.user_id
JOIN purchases p2 ON f2.id = p2.user_id
WHERE u.id = 12345
  AND p1.product_id = p2.product_id
  AND f2.id != u.id;

-- At 3+ hops, this becomes exponentially slower
-- 1M users, 10M friendships: 2 hops = seconds, 3 hops = minutes, 4 hops = timeout

-- Cypher (Neo4j): Same query
MATCH (u:User {id: 12345})-[:FRIENDS*2]->(fof:User),
      (u)-[:BOUGHT]->(p:Product)<-[:BOUGHT]-(fof)
WHERE u <> fof
RETURN DISTINCT fof.name
-- Runs in milliseconds regardless of graph size

Creating a Social Graph

// Create nodes
CREATE (alice:User {name: "Alice", age: 30, city: "Mumbai"})
CREATE (bob:User {name: "Bob", age: 28, city: "Delhi"})
CREATE (charlie:User {name: "Charlie", age: 35, city: "Mumbai"})
CREATE (phone:Product {name: "iPhone 16", price: 999, category: "Electronics"})
CREATE (laptop:Product {name: "MacBook Pro", price: 2499, category: "Electronics"})

// Create relationships (with properties)
CREATE (alice)-[:FRIENDS_WITH {since: 2022}]->(bob)
CREATE (bob)-[:FRIENDS_WITH {since: 2023}]->(charlie)
CREATE (alice)-[:BOUGHT {date: "2026-01-15", amount: 999}]->(phone)
CREATE (charlie)-[:BOUGHT {date: "2026-01-20", amount: 999}]->(phone)
CREATE (bob)-[:BOUGHT {date: "2025-12-01", amount: 2499}]->(laptop)

Querying — Pattern Matching with Cypher

// Recommendation: "People who bought this also bought..."
MATCH (u:User)-[:BOUGHT]->(p:Product {name: "iPhone 16"})<-[:BOUGHT]-(other:User)
      -[:BOUGHT]->(rec:Product)
WHERE rec <> p
RETURN rec.name, COUNT(*) AS score
ORDER BY score DESC
LIMIT 5

// Fraud detection: Find circular money transfers
MATCH path = (a:Account)-[:TRANSFERRED*3..6]->(a)
WHERE ALL(r IN relationships(path) WHERE r.amount > 10000)
RETURN path, length(path) AS hops

// Shortest path between two users
MATCH path = shortestPath(
    (alice:User {name: "Alice"})-[:FRIENDS_WITH*]-(target:User {name: "Charlie"})
)
RETURN path, length(path) AS degrees_of_separation

// Knowledge graph: Find all skills connected to a technology
MATCH (t:Technology {name: "Kubernetes"})-[:REQUIRES|USES*1..3]->(skill)
RETURN DISTINCT skill.name, labels(skill)

Related Articles