6. • all JOINs are executed every time you query
(traverse) the relationship
• executing a JOIN means to search for a key in
another table
• with Indices executing a JOIN means to lookup a key
• B-Tree Index: O(log(n))
• more entries => more lookups => slower JOINs
The Problem
8. Max
Big Data Tech Con
NoSQL Now
Chariot Data IO
143
326
725
981
143 981
143 725
143 326
9. uid: MDM!
name: Max
uid: BDTC!
where: Burlinggame
uid: NSN!
where: San Francisco
uid: CDIO!
where: Philadelphia
Nodes
Relationships
member
member
member
A Property Graph
10. The Neo4j Secret Sauce
• Pointers instead of
look-ups
• Do all your “Joining”
on creation
• Spin spin spin
through this data
structure
12. • Neo4j is the leading graph database in
the world today
• Most widely deployed: 500,000+
downloads
• Largest ecosystem: active forums,
code contributions, etc
• Most mature product: in development
since 2000, in 24/7 production since
2003
The Neo4j Graph Database
14. Evolution of Web Search
Survival of the Fittest
Pre-1999
WWW Indexing
Discrete Data
1999 - 2012
Google Invents
PageRank
Connected Data
(Simple)
2012-?
Google Knowledge Graph,
Facebook Graph Search
Connected Data
(Rich)
