18. “ By definition, a graph database is any storage
system that provides index-free adjacency. ”
“ This means that every element contains a
direct pointer to its adjacent element and no
index lookups are necessary. ”
25. NEO4J SCALING
Master-slave replication
Cache-based sharding
Feature-based polyglot'ing
64B limit on nodes, rels, props
But can be easily upped; just flipping some bits
100 props/node (high) ⇒ 640M nodes
32. WHAT WE LEARNED
Unique, expressive relationship types
Cache stats where possible
Capture history through event nodes
33.
34. WHAT WE LEARNED
Unique, expressive relationship types
Cache stats where possible
Capture history through event nodes
First-class objects ⇒ nodes, not rels
35.
36. WHAT WE LEARNED
Unique, expressive relationship types
Cache stats where possible
First-class objects ⇒ nodes, not rels
Capture history through event nodes
Connected data ⇒ nodes, not props
37.
38. WHAT WE LEARNED
Unique, expressive relationship types
Cache stats where possible
First-class objects ⇒ nodes, not rels
Capture history through event nodes
Connected data ⇒ nodes, not props
Maintain linked lists for O(1) queries
39. NEO4J ROADMAP
Overhaul of indexing API
Relationship type grouping
Socket and/or binary protocol
Automatic sharding?