Download as PDF, PPTX
Uploaded byDani Traphagen
Diving into DSE Graph
The document discusses DSE Graph and introduces key concepts such as property graphs, vertices, edges, properties, and the Gremlin graph traversal language. It emphasizes the importance of understanding graph structures and provides insights into different types of graph traversals. The session aims to enhance comprehension of graph databases and their real-world applications.
![[DSC Europe 25] Elena Menshikova - AI-Powered Operational Excellence: Revolut...](https://cdn.slidesharecdn.com/ss_thumbnails/es6nholbqy3zaao2c2yd-2-elena-menshikova-data-ai-in-decision-making-260115093812-4fba8b38-thumbnail.jpg?width=640&height=640&fit=bounds)
![[DSC Europe 25] Stefan Brankovic - #ResumeIsDead. AI-Powered Interviews and C...](https://cdn.slidesharecdn.com/ss_thumbnails/qnmbsv0xq3uysdrq3sev-2-stefan-brankovic-job-bolt-260114111931-a065aa3d-thumbnail.jpg?width=640&height=640&fit=bounds)
![[DSC Europe 25] Nikola Vasiljevic - Player segmentation by combat playstyles ...](https://cdn.slidesharecdn.com/ss_thumbnails/mnvbf0yvrwaqsipzrrv3-2-nikola-vasiljevic-player-segmentation-by-playstyles-in-action-shooter-games-260114111931-b4d766cd-thumbnail.jpg?width=640&height=640&fit=bounds)
![[DSC Europe 25] Ivan Lukovic & Marija Djukic - From Data to Value: Why Maturi...](https://cdn.slidesharecdn.com/ss_thumbnails/ahrfps8xr6knowwhacxh-1-ivan-marija-dsc-2025-ld-v1-presentation-260115093812-be21adfc-thumbnail.jpg?width=640&height=640&fit=bounds)
![[DSC Europe 25] Mijat Kustudic - Building Financial Intelligence with AI Agen...](https://cdn.slidesharecdn.com/ss_thumbnails/38y2lb5lse6wstegtvas-3-mijat-kustudic-building-financial-intelligence-with-ai-agents-260114111931-1a4783ce-thumbnail.jpg?width=640&height=640&fit=bounds)
Diving into DSE Graph
- 1. DIVING INTO DSEGRAPHWITH DANI TRAPHAGEN, DATASTAX @DTRAPEZOID -FOR ?S-
- 2. DIVING INTO DSEGRAPHWITH DANI TRAPHAGEN, DATASTAX @DTRAPEZOID -FOR ?S-
- 3. DIVING INTO DSEGRAPHWITH DANI TRAPHAGEN, DATASTAX @DTRAPEZOID -FOR ?S-
- 4. DIVING INTO DSEGRAPHWITH DANI TRAPHAGEN, DATASTAX @DTRAPEZOID -FOR ?S-
- 5. DIVING INTO DSEGRAPHWITH DANI TRAPHAGEN, DATASTAX @DTRAPEZOID -FOR ?S-
- 6. DIVING INTO DSEGRAPHWITH DANI TRAPHAGEN, DATASTAX @DTRAPEZOID -FOR ?S-
- 7. DIVING INTO DSEGRAPHWITH DANI TRAPHAGEN, DATASTAX @DTRAPEZOID -FOR ?S-
- 8. DIVING INTO DSEGRAPHWITH DANI TRAPHAGEN, DATASTAX @DTRAPEZOID -FOR ?S- eats
- 9. DIVING INTO DSEGRAPHWITH DANI TRAPHAGEN, DATASTAX @DTRAPEZOID -FOR ?S- eats
- 10. DIVING INTO DSEGRAPHWITH DANI TRAPHAGEN, DATASTAX @DTRAPEZOID -FOR ?S- scaredOf eats
- 11. DIVING INTO DSEGRAPHWITH DANI TRAPHAGEN, DATASTAX @DTRAPEZOID -FOR ?S- scaredOf eats
- 12. DIVING INTO DSEGRAPHWITH DANI TRAPHAGEN, DATASTAX @DTRAPEZOID -FOR ?S- scaredOf scaredOf eats
- 13. DIVING INTO DSEGRAPHWITH DANI TRAPHAGEN, DATASTAX @DTRAPEZOID -FOR ?S- scaredOf scaredOf eats eats
- 14. DIVING INTO DSEGRAPHWITH DANI TRAPHAGEN, DATASTAX @DTRAPEZOID -FOR ?S- scaredOf scaredOf eats eats
- 15. OMG GRAPHS EXPRESS RELATIONSHIPSIN THE REAL WORLD, SO, LIKE, EVERYTHING IS A GRAPH PROBLEM!
- 16. OMG GRAPHS EXPRESS RELATIONSHIPSIN THE REAL WORLD, SO, LIKE, EVERYTHING IS A GRAPH PROBLEM!
- 17.
- 18. THE WORLD ISNOT YOUR OYSTER
- 19. OK, SO WHEN SHOULDI USE IT?
- 20. OK, SO WHEN SHOULDI USE IT?
- 21.
- 22. WHAT’S THAT, DANI, MYNEW FRIEND?
- 23.
- 24.
- 25.
- 26. PROPERTY GRAPHS WHAT ISA PROPERTY GRAPH? ▸Directed, binary, attributed multi-graph ▸ Vertices ▸ Edges ▸ Properties
- 27. PROPERTY GRAPHS VERTICES ▸ Alwayshave unique ID & Label ▸ Can be attached to vertices and edges ▸ Have name, value & so much more ▸ Grossly Simplified Here
- 28. PROPERTY GRAPHS VERTICES ▸ Alwayshave unique ID & Label ▸ Can be attached to vertices and edges ▸ Have name, value & so much more ▸ Grossly Simplified Here ME
- 29. PROPERTY GRAPHS VERTICES ▸ Alwayshave unique ID & Label ▸ Can be attached to vertices and edges ▸ Have name, value & so much more ▸ Grossly Simplified Here YOUME
- 30. PROPERTY GRAPHS EDGES ▸ Edgesconnect vertices with both directionality and label ▸ They connect EXACTLY 2 vertices and they always have direction… ▸ Unlike me in life… ▸ JK, I’m fine, really HAHA, FRIENDSHIP! IKR? YOUME FRIENDS
- 31. PROPERTY GRAPHS PROPERTIES ▸ Wherethe Property Graph gets its name ▸ K:V pairs ▸ Associated with any vertex (entity) or edge (relationship) in a property graph YOUME LOVES CATS FRIENDS
- 32. PROPERTY GRAPHS PROPERTIES ▸ Wherethe Property Graph gets its name ▸ K:V pairs ▸ Associated with any vertex (entity) or edge (relationship) in a property graph YOUME HATES CATS LOVES CATS FRIENDS
- 33. PROPERTY GRAPHS MULTI-PROPERTIES ▸ Morethan 1 property YOUME LOVES CATS HATES CATS FRIENDS
- 34. PROPERTY GRAPHS MULTI-PROPERTIES ▸ Morethan 1 property YOUME LOVES CATS HATES CATS LOVES BATMAN FRIENDS
- 35. PROPERTY GRAPHS MULTI-PROPERTIES ▸ Morethan 1 property YOUME LOVES CATS HATES CATS LOVES BATMAN LOVES BATMAN FRIENDS
- 36. PROPERTY GRAPHS META-PROPERTIES ▸ Propertiesabout properties YOUME LOVES CATS HATES CATS LOVES BATMAN LOVES BATMAN WATCHES BATMAN ON FRI WATCHES BATMAN ON FRI FRIENDS
- 37. PROPERTY GRAPHS FINAL PROPERTYGRAPH ▸ We’ve built a nice story here ▸ But this is just a subgraph ▸ Our final property graph comprises everything YOUME LOVES CATS HATES CATS LOVES BATMAN LOVES BATMAN WATCHES BATMAN ON FRI WATCHES BATMAN ON FRI FRIENDS
- 38. PROPERTY GRAPHS FINAL PROPERTYGRAPH ▸ We’ve built a nice story here ▸ But this is just a subgraph ▸ Our final property graph comprises everything YOUME LOVES CATS HATES CATS LOVES BATMAN LOVES BATMAN WATCHES BATMAN ON FRI WATCHES BATMAN ON FRI LOVES JOHNNY DEPP FRIENDS
- 39. PROPERTY GRAPHS FINAL PROPERTYGRAPH ▸ We’ve built a nice story here ▸ But this is just a subgraph ▸ Our final property graph comprises everything YOUME LOVES CATS HATES CATS LOVES BATMAN LOVES BATMAN WATCHES BATMAN ON FRI WATCHES BATMAN ON FRI HATES JOHNNY DEPP LOVES JOHNNY DEPP FRIENDS
- 40.
- 41. YOU GOT IT: AREAL FINAL PROPERTY GRAPH
- 42.
- 43. THE GREMLIN GRAPH TRAVERSALLANGUAGE
- 44. THE GREMLIN GRAPHTRAVERSAL LANGUAGE WHAT’S THIS GREMLIN NOW? ▸ Gremlin is defined by Apache TinkerPop ▸ Expressive language to define traversals ▸ Yo, what good is a graph db if we can’t traverse it? ▸ Functional language with a fluent syntax ▸ Bindings in Groovy, Java8, Scala, Closure, and more
- 45. LINEAR MOTIF: TRAVERSAL ISA SEQUENCE OF STEPS
- 46. NESTED MOTIF: TRAVERSAL ISA TREE OF STEPS
- 47.
- 48.
- 49.
- 50.
- 51. BECOMING PROFICIENT INGREMLIN GRAPH TRAVERSAL STEP EVALUATION ▸ Lazy evaluation ▸ Everything is lazily evaluated ▸ All but barrier steps ▸ Barrier steps ▸ Collecting barrier steps: aggregate, barrier, order, sample ▸ Reducing barrier steps: count, fold, max, min, sum ▸ Supplying barrier step: cap
- 52. HOW DO IGET GREMLIN- DANGEROUS?
- 53. HOW DO IGET GREMLIN- DANGEROUS? LEARN TO TRAVERSE LIKE A BOSS
- 54. HOW DO IGET GREMLIN- DANGEROUS? LEARN TO TRAVERSE LIKE A BOSS
- 55.
- 56. TRAVERSAL TYPES SO MANYTRAVERSALS! ▸ Simple Traversal ▸ Branching Traversal ▸ Recursive Traversal ▸ Path Traversal ▸ Projecting Traversal ▸ Declarative Traversal ▸ Subgraph Traversal ▸ Statistical Traversal ▸ Ordering Traversal ▸ Mutating Traversal ▸ Domain Specific Traversal
- 57. TRAVERSAL TYPES LET’S JUSTTALK ABOUT 1 TYPE OF GRAPH TRAVERSAL* ▸Simple *WISH WE HAD TIME TO ADDRESS RECURSIVE & STATISTICAL TOO BUT THAT WON’T LIKELY HAPPEN, I HAVE DEMOS ON THEM, IF WE DO. WE JUST GOTTA PICK OUR POISONS WITH LIMITED TIME. :’(
- 58.
- 59. THE MOST BASIC GRAPHTRAVERSAL ▸Moves traverser through steps in sequential order ▸Contains no internal, nested traversals
- 60. PREREQUISITES: VERTEX STEPS &NAVIGATION
- 61.
- 62. SIMPLE TRAVERSAL WITHIN Find Johnny Depp’s movies released in 2010 or later:
- 63. SIMPLE TRAVERSAL WITHIN AND OUT Find directors of Johnny Depp’s movies released in 2010 or later:
- 64. SIMPLE TRAVERSAL WITHIN AND INE Find user ratings for Johnny Depp’s movies released in 2010 or later:
- 65.
- 66. SIMPLE TRAVERSAL WITH IN,INE, AND OUTV Find ages of users who left 7 or 8 star ratings for Johnny Depp’s movies released in 2010 or later
- 67.
- 68.