Graph Talk München

Holger Temme

Area Director Central + Southern Europe

Node

Relationship

complexity = f(size, semi-structure,

connectedness)

The Real Complexity

Connectedness in data

Lots of normalized relationships between the different entities, forces developers to do• Deep joins• Recursive joins• Pathfinding operations• “open-ended” queries

What are graphs good for?

Complex querying of

big volumes of

connected data

So what is a graph database?• Neo4j is a OLTP database - capable of handling very complex analytical queries in real time• Model, store, manage data as a graph

Logistics

Logistics

Logistics

Fraud Analysis

Traditional Approaches

Gartner’s Layered Fraud Prevention Approach (4)

(4): Gartner at http://www.gartner.com/newsroom/id/1695014

Discrete Data Analysis Connected Analysis

(4): Gartner at http://www.gartner.com/newsroom/id/1695014

Gartner’s Layered Fraud Prevention Approach (4)

Access Control

Network Impact Analysis

Social Network

Recommendations

Operational efficiency

• Minutes to millisecond performance for specific query patterns– Savings on HW/SW costs!– Graph locality = predictability

• Enterprise-ready software– Proven technology: in production for >10y