graph all teh things 111
play

Graph All Teh Things!!!111 Graph Database Use Cases That Arent - PowerPoint PPT Presentation

Jul 03, 2023 •302 likes •783 views

Graph All Teh Things!!!111 Graph Database Use Cases That Arent Social GOTO Berlin, 2014 Emil Eifrem emil@neotechnology.com @emileifrem #neo4j Neo Technology, Inc Confidential Thursday, November 6, 14 1 Agenda 1. Context 2. Wait! What

  1. Graph All Teh Things!!!111 Graph Database Use Cases That Aren’t Social GOTO Berlin, 2014 Emil Eifrem emil@neotechnology.com @emileifrem #neo4j Neo Technology, Inc Confidential Thursday, November 6, 14 1

  2. Agenda 1. Context 2. Wait! What Is A Graph Anyway? 3. !Social Graph Use Cases Neo Technology, Inc Confidential Thursday, November 6, 14 2

  3. WARNING! ALL I’M OFFERING IS THE TRUTH Neo Technology, Inc Confidential Thursday, November 6, 14 3

  4. Victims Neo Technology, Inc Confidential Thursday, November 6, 14 4

  5. Victims Neo Technology, Inc Confidential Thursday, November 6, 14 5

  6. Context Neo Technology, Inc Confidential Thursday, November 6, 14 6

  7. Neo Technology, Inc Confidential Thursday, November 6, 14 7

  8. Graphs Are Eating The World Neo Technology, Inc Confidential Thursday, November 6, 14 8

  9. C 34,3% B A 38,4% 3,3% F 3,9% D 3,8% E 8,1% 1,8% 1,8% 1,8% 1,8% 1,8% Neo Technology, Inc Confidential Thursday, November 6, 14 9

  10. Neo Technology, Inc Confidential Thursday, November 6, 14 10

  11. Neo Technology, Inc Confidential Thursday, November 6, 14 11

  12. Core industries WEB / ISV Financial Services Tele-communications & Use Cases Network & Data Center Management Master Data Management Social Geo Neo Technology, Inc Confidential Thursday, November 6, 14 12

  13. Core industries WEB / ISV Financial Services Tele-communications & Use Cases & Life Sciences Network & Data Center Finance Management Master Data Management Social GEO Neo Technology, Inc Confidential Thursday, November 6, 14 13

  14. Graphs Are Growin’ Source: http://db-engines.com/en/ranking/graph+dbms ! Neo Technology, Inc Confidential Thursday, November 6, 14 14

  15. Graph Databases In The Enterprise 30% “Forrester estimates that over 25% 25% % of Enterprises using Graph Databases of enterprises will be using graph databases by 2017” 20% “25% of survey respondents said they plan to use Graph databases 10% in the future.” 2.5% Sources • Forrester TechRadar™ : Enterprise DBMS, Feb 13 2014 (http://www.forrester.com/TechRadar+Enterprise 0% +DBMS+Q1+2014/fulltext/-/E-RES106801) 0% • Dataversity Mar 31 2014: “Deconstructing NoSQL: Analysis of a 2013 Survey on the Use, Production and Assessment 2011 2014 2017 Technologies in the Enterprise” (http://www.dataversity.net) of NoSQL • Neo Technology customer base in 2011 and 2014 • Estimation of other graph vendors’ customer base in 2011 and 2014 based on best available intelligence Neo Technology, Inc Confidential Thursday, November 6, 14 15

  16. What Is A Graph, Anyway? Neo Technology, Inc Confidential Thursday, November 6, 14 16

  17. The Property Graph Model Thursday, November 6, 14 17

  18. The Property Graph Model Ann Loves Dan Thursday, November 6, 14 18

  19. The Property Graph Model Loves Ann Dan Thursday, November 6, 14 19

  20. The Property Graph Model Loves Ann Dan (Ann) –[:LOVES]-> (Dan) Thursday, November 6, 14 20

  21. The Property Graph Model Loves Ann Dan (:Person {name:"Ann"}) –[:LOVES]-> (:Person {name:"Dan"}) Thursday, November 6, 14 21

  22. The Property Graph Model Loves Ann Dan (:Person {name:"Ann"}) –[:LOVES]-> (:Person {name:"Dan"}) Node Relationship Node Thursday, November 6, 14 22

  23. Cypher Query: Whom does Ann love? (:Person {name:"Ann"})–[:LOVES]->(whom) Thursday, November 6, 14 23

  24. Cypher Query: Whom does Ann love? MATCH (:Person {name:"Ann"})–[:LOVES]->(whom) Thursday, November 6, 14 24

  25. Cypher Query: Whom does Ann love? MATCH (:Person {name:"Ann"})–[:LOVES]->(whom) RETURN whom Thursday, November 6, 14 25

  26. Neo Technology, Inc Confidential Thursday, November 6, 14 26

  27. MATCH ( me:Person )-[:IS_FRIEND_OF]->(friend:Person), (friend)-[:LIKES]->(restaurant), (restaurant)-[:LOCATED_IN]->( newyork:City ), (restaurant)-[:SERVES]->( sushi:Cuisine ) WHERE me.name = 'Emil' AND newyork.location='New York' AND sushi.cuisine='Sushi' RETURN restaurant.name http://maxdemarzi.com/?s=facebook Neo Technology, Inc Confidential Thursday, November 6, 14 27

  28. Example HR Query (using SQL) *“Find all direct reports and how many they manage, up to 3 levels down” Thursday, November 6, 14 28

  29. Example HR Query (using SQL) (SELECT T.directReportees AS directReportees, sum(T.count) AS count (continued from previous page...) FROM ( SELECT depth1Reportees.pid AS directReportees, SELECT manager.pid AS directReportees, 0 AS count count(depth2Reportees.directly_manages) AS count FROM person_reportee manager FROM person_reportee manager WHERE manager.pid = (SELECT id FROM person WHERE name = "fName lName") JOIN person_reportee L1Reportees UNION ON manager.directly_manages = L1Reportees.pid SELECT manager.pid AS directReportees, count(manager.directly_manages) AS count JOIN person_reportee L2Reportees FROM person_reportee manager ON L1Reportees.directly_manages = L2Reportees.pid WHERE manager.pid = (SELECT id FROM person WHERE name = "fName lName") WHERE manager.pid = (SELECT id FROM person WHERE name = "fName lName") GROUP BY directReportees GROUP BY directReportees UNION ) AS T SELECT manager.pid AS directReportees, count(reportee.directly_manages) AS count GROUP BY directReportees) FROM person_reportee manager UNION JOIN person_reportee reportee (SELECT T.directReportees AS directReportees, sum(T.count) AS count ON manager.directly_manages = reportee.pid FROM( WHERE manager.pid = (SELECT id FROM person WHERE name = "fName lName") SELECT reportee.directly_manages AS directReportees, 0 AS count GROUP BY directReportees FROM person_reportee manager UNION JOIN person_reportee reportee SELECT manager.pid AS directReportees, count(L2Reportees.directly_manages) AS count ON manager.directly_manages = reportee.pid FROM person_reportee manager WHERE manager.pid = (SELECT id FROM person WHERE name = "fName lName") JOIN person_reportee L1Reportees GROUP BY directReportees ON manager.directly_manages = L1Reportees.pid UNION JOIN person_reportee L2Reportees SELECT L2Reportees.pid AS directReportees, count(L2Reportees.directly_manages) AS ON L1Reportees.directly_manages = L2Reportees.pid count WHERE manager.pid = (SELECT id FROM person WHERE name = "fName lName") FROM person_reportee manager GROUP BY directReportees JOIN person_reportee L1Reportees ) AS T ON manager.directly_manages = L1Reportees.pid GROUP BY directReportees) JOIN person_reportee L2Reportees UNION ON L1Reportees.directly_manages = L2Reportees.pid (SELECT T.directReportees AS directReportees, sum(T.count) AS count WHERE manager.pid = (SELECT id FROM person WHERE name = "fName lName") FROM ( GROUP BY directReportees SELECT manager.directly_manages AS directReportees, 0 AS count ) AS T FROM person_reportee manager GROUP BY directReportees) WHERE manager.pid = (SELECT id FROM person WHERE name = "fName lName") UNION UNION (SELECT L2Reportees.directly_manages AS directReportees, 0 AS count SELECT reportee.pid AS directReportees, count(reportee.directly_manages) AS count FROM person_reportee manager FROM person_reportee manager JOIN person_reportee L1Reportees JOIN person_reportee reportee ON manager.directly_manages = L1Reportees.pid ON manager.directly_manages = reportee.pid JOIN person_reportee L2Reportees WHERE manager.pid = (SELECT id FROM person WHERE name = "fName lName") ON L1Reportees.directly_manages = L2Reportees.pid GROUP BY directReportees WHERE manager.pid = (SELECT id FROM person WHERE name = "fName lName") UNION ) *“Find all direct reports and how many they manage, up to 3 levels down” Thursday, November 6, 14 29

  30. Same Query in Cypher MATCH ¡( boss)-­‑[:MANAGES*0..3]-­‑>(sub), ¡ ¡ ¡ ¡ ¡ ¡(sub)-­‑[:MANAGES*1..3]-­‑>(report) WHERE ¡ boss.name ¡= ¡“John ¡Doe” RETURN ¡sub.name ¡ AS ¡Subordinate, ¡ count (report) ¡ AS ¡Total *“Find all direct reports and how many they manage, up to 3 levels down” Thursday, November 6, 14 30

  31. QUERY TIME DATABASE # PEOPLE (MS) 1,000 2,000 MySQL 1,000 2 Neo4j 1,000,000 2 Neo4j Thursday, November 6, 14 31

  32. M’kay. But what about the Real World(tm)? “Our ¡Neo4j ¡solution ¡is ¡literally ¡ thousands ¡of ¡times ¡ faster ¡than ¡the ¡prior ¡MySQL ¡solution, with ¡queries ¡that ¡require ¡ 10-­‑100 ¡times ¡less ¡code .” -­‑ ¡Volker ¡Pacher, ¡Senior ¡Developer ¡eBay Neo Technology, Inc Confidential Thursday, November 6, 14 32

  33. !Social Graph Use Cases Neo Technology, Inc Confidential Thursday, November 6, 14 33

  34. Network Impact Analysis Neo Technology, Inc Confidential Thursday, November 6, 14 34

  35. Route Finding Neo Technology, Inc Confidential Thursday, November 6, 14 35

  36. Recommendations Neo Technology, Inc Confidential Thursday, November 6, 14 36

  37. Logistics Neo Technology, Inc Confidential Thursday, November 6, 14 37

  38. Access Control Neo Technology, Inc Confidential Thursday, November 6, 14 38

  39. Fraud Detection Neo Technology, Inc Confidential Thursday, November 6, 14 39

Recommend

Oded Green Going to talk about 2 things A scalable and dynamic data structure for graph

Oded Green Going to talk about 2 things A scalable and dynamic data structure for graph

cuSTINGER A Sparse Dynamic Graph and Matrix Data Structure Oded Green Going to talk about 2 things A scalable and dynamic data structure for graph algorithms and linear algebra based problems A framework for static and dynamic

928 views • 57 slides
A Sparse Dynamic Graph and Matrix Data Layout Oded Green Going to talk about 2 things Hornet

A Sparse Dynamic Graph and Matrix Data Layout Oded Green Going to talk about 2 things Hornet

A Sparse Dynamic Graph and Matrix Data Layout Oded Green Going to talk about 2 things Hornet A scalable and dynamic data structure for graph algorithms and linear algebra based problems Formerly known as cuSTINGER HornetsNest

809 views • 35 slides
1-bend RAC Drawings of 1-Planar Graphs Walter Didimo, Giuseppe Liotta, Saeed Mehrabi, Fabrizio

1-bend RAC Drawings of 1-Planar Graphs Walter Didimo, Giuseppe Liotta, Saeed Mehrabi, Fabrizio

1-bend RAC Drawings of 1-Planar Graphs Walter Didimo, Giuseppe Liotta, Saeed Mehrabi, Fabrizio Montecchiani Things to avoid in graph drawing Things to avoid in graph drawing Too many crossings Things to avoid in graph drawing Too many

1.16k views • 66 slides
Graph Traversal Graph Traversal with DFS/BFS One of the most fundamental graph problems is to

Graph Traversal Graph Traversal with DFS/BFS One of the most fundamental graph problems is to

Graph Traversal Graph Traversal with DFS/BFS One of the most fundamental graph problems is to traverse every Tyler Moore edge and vertex in a graph. CSE 3353, SMU, Dallas, TX For correctness, we must do the traversal in a systematic way so

736 views • 5 slides
GRAPH MINING AND GRAPH KERNELS Part I: Graph Mining Karsten Borgwardt^ and Xifeng Yan*

GRAPH MINING AND GRAPH KERNELS Part I: Graph Mining Karsten Borgwardt^ and Xifeng Yan*

Graph Mining and Graph Kernels GRAPH MINING AND GRAPH KERNELS Part I: Graph Mining Karsten Borgwardt^ and Xifeng Yan* ^University of Cambridge *IBM T. J. Watson Research Center August 24, 2008 | ACM SIG KDD, Las Vegas Graph Mining and Graph

1.28k views • 60 slides
Revelation 1:19 Write the things which you have seen, and the things which are, and the

Revelation 1:19 Write the things which you have seen, and the things which are, and the

Revelation 1:19 Write the things which you have seen, and the things which are, and the things which will take place after this. Revelation 4:1 After these things I looked, and behold, a door standing open in heaven. And the

438 views • 30 slides
Graph Mining Marco Serafini COMPSCI 532 Lecture 11 Classes of Graph Systems Graph

Graph Mining Marco Serafini COMPSCI 532 Lecture 11 Classes of Graph Systems Graph

Graph Mining Marco Serafini COMPSCI 532 Lecture 11 Classes of Graph Systems Graph Computation Think like a vertex Linear algebra Graph Search Find instances of path expressions Graph Mining Mine patterns of

436 views • 16 slides
Finding your way in a graph Finding your way in a graph Finding your way in a graph Finding your

Finding your way in a graph Finding your way in a graph Finding your way in a graph Finding your

Finding your way in a graph Finding your way in a graph Finding your way in a graph Finding your way in a graph = station One loop = junction A system of interconnected loops L L What is the best way to go from L to ? L L L 1 ? L

2.13k views • 166 slides
Securing the Web of Things Andrei Sabelfeld @asabelfeld Web of Things Internet of Things (IoT)

Securing the Web of Things Andrei Sabelfeld @asabelfeld Web of Things Internet of Things (IoT)

Securing the Web of Things Andrei Sabelfeld @asabelfeld Web of Things Internet of Things (IoT) Incompatible standards, platforms, technologies World Wide Web Consortium (W3C) is in a unique position to create the royalty-free and

273 views • 15 slides
Graph Sparsifiers Smaller graph that (approximately) preserves the values of some set of

Graph Sparsifiers Smaller graph that (approximately) preserves the values of some set of

Graph Sparsifiers Smaller graph that (approximately) preserves the values of some set of graph parameters Graph Sparsification Graph Sparsifiers Spanners Emulators Small stretch spanning trees Vertex sparsifiers

861 views • 34 slides
GRAPH MINING AND GRAPH KERNELS Part II: Graph Kernels Karsten Borgwardt^ and Xifeng Yan*

GRAPH MINING AND GRAPH KERNELS Part II: Graph Kernels Karsten Borgwardt^ and Xifeng Yan*

Graph Mining and Graph Kernels GRAPH MINING AND GRAPH KERNELS Part II: Graph Kernels Karsten Borgwardt^ and Xifeng Yan* ^University of Cambridge *IBM T. J. Watson Research Center August 24, 2008 | ACM SIG KDD, Las Vegas Graph Mining and

1.16k views • 48 slides
1 Matrix notation and preliminaries from spectral graph theory Spectral graph theory studies

1 Matrix notation and preliminaries from spectral graph theory Spectral graph theory studies

CS 224W Graph clustering Austin Benson Graph clustering (or community detection or graph partitioning) is one of the most studied problems in network analysis. One reason for this is that there are a variety of ways to define a cluster

319 views • 9 slides
Graph Exploration w/ Neo4j 1

Graph Exploration w/ Neo4j 1

Graph Exploration w/ Neo4j 1 https://s3.amazonaws.com/dev.assets.neo4j.com/wp-content/uploads/graph-data-technologies-graph-databases-for-beginners.png Our Project Partners 2 Efficiently extracting knowledge from graph data even if we do not

777 views • 25 slides
Hebrews 6:9, But, beloved, we are confident of better things concerning you yes things of

Hebrews 6:9, But, beloved, we are confident of better things concerning you yes things of

Hebrews 6:9, But, beloved, we are confident of better things concerning you yes things of better things concerning you, yes, things that accompany salvation, though we speak in this manner. Hebrews 6:10, For God is not unjust to forget

739 views • 41 slides
It's a Tree... It's a Graph... It's a Tree... It's a Graph... It's a Traph!!!! It's a Traph!!!!

It's a Tree... It's a Graph... It's a Tree... It's a Graph... It's a Traph!!!! It's a Traph!!!!

It's a Tree... It's a Graph... It's a Tree... It's a Graph... It's a Traph!!!! It's a Traph!!!! Designing an on-le multi-level graph index for the Hyphe web crawler Paul Girard Mathieu Jacomy Benjamin Ooghe-Tabanou Guillaume Plique

894 views • 85 slides
Mria Markoov Graph definition Degree, in, out degree, oriented graph.

Mria Markoov Graph definition Degree, in, out degree, oriented graph.

Mria Markoov Graph definition Degree, in, out degree, oriented graph. Complete, regular, bipartite graph. Graph representation, connectivity, adjacency. Isomorphism of graphs. Paths, cycles, trials. Random

735 views • 42 slides
Whats left? How do we get from here to there? Need: 1. Common Vocabulary 2. Graph

Whats left? How do we get from here to there? Need: 1. Common Vocabulary 2. Graph

Announcements PA3 available, due 03/30, 11:59p. Graphs!! G = (V,E) Tree: Simple (sub)Graph: Spanning subgraph: Connected (sub)Graph: Spanning tree: Connected component: G = (V,E) Graph Vocabulary: Use the graph G to answer these questions.

223 views • 8 slides
The Codex BUILDING A GRAPH OF HISTORY What is Codex? v Text-as-a-Graph with the aim to achieve

The Codex BUILDING A GRAPH OF HISTORY What is Codex? v Text-as-a-Graph with the aim to achieve

The Codex BUILDING A GRAPH OF HISTORY What is Codex? v Text-as-a-Graph with the aim to achieve the deep integration of text and data v Manages standoff property documents linked to graph entities v Graph meta-model defined by composition from

388 views • 22 slides
9/6/20 Exceptions: What to do when things go bad IO: Where things often go bad 1 An exception

9/6/20 Exceptions: What to do when things go bad IO: Where things often go bad 1 An exception

9/6/20 Exceptions: What to do when things go bad IO: Where things often go bad 1 An exception is an object describing unusual or erroneous situation Division by 0 in computing expression (ArithmeticException) Array index out of bounds

371 views • 8 slides
Graphs Introduction Graph Graph A graph G = ( V , E ) is a set V of vertices connected by an

Graphs Introduction Graph Graph A graph G = ( V , E ) is a set V of vertices connected by an

Graphs Introduction Graph Graph A graph G = ( V , E ) is a set V of vertices connected by an edge set E . 2 / 13 Variations Multi-Graph: Multiple edges between two vertices. Directed: Edges have a direction. Weighted: Vertices and/or edges

241 views • 13 slides
Graph Neural Network Fang Yuanqiang, 2019/05/18 Graph Neural Network Why GNN? Preliminary

Graph Neural Network Fang Yuanqiang, 2019/05/18 Graph Neural Network Why GNN? Preliminary

Graph Neural Network Fang Yuanqiang, 2019/05/18 Graph Neural Network Why GNN? Preliminary Fixed graph Vanilla Spectral Graph ConvNets ChebyNet GCN CayleyNet Multiple graphs Variable graph

817 views • 46 slides
Some remarks on ! 2 e 00 E ! 2 e 00 E w equivalence of graph-to-graph

Some remarks on ! 2 e 00 E ! 2 e 00 E w equivalence of graph-to-graph

E e E e 0 E Some remarks on ! 2 e 00 E ! 2 e 00 E w equivalence of graph-to-graph transducers inc( w, e 0 ) inc( w, e 00 ) Schmude, J. Boja czyk, M. University of Warsaw Highlights of Logic,

692 views • 22 slides
Speedup Graph Processing by Graph Ordering Hao Wei, Jeffrey Xu Yu, Can Lu, Xuemin Lin

Speedup Graph Processing by Graph Ordering Hao Wei, Jeffrey Xu Yu, Can Lu, Xuemin Lin

Speedup Graph Processing by Graph Ordering Hao Wei, Jeffrey Xu Yu, Can Lu, Xuemin Lin Presented by: Bishesh Khadka MIT 6.886 - Graph Analytics Motivation Graphs are important CPU cache performance is key issue in efficiency in DBS

335 views • 21 slides
Graph Algorithms Chapter 22 1 CPTR 430 Algorithms Graph Algorithms Why Study Graph Algorithms?

Graph Algorithms Chapter 22 1 CPTR 430 Algorithms Graph Algorithms Why Study Graph Algorithms?

Graph Algorithms Chapter 22 1 CPTR 430 Algorithms Graph Algorithms Why Study Graph Algorithms? Mathematical graphs seem to be relatively specialized and abstract Why spend so much time and effort on algorithms for such an obscure area?

745 views • 47 slides

More recommend