![Shortest Path with Gremlin
13
What is the shortest path to Berlin?
DataWorks Summit San Jose / IBM Meetup / June 18, 2018 / © 2018 IBM Corporation
Image credit: Apache TinkerPop, ALv2
> g.V(rdu).
repeat( out('route').simplePath() ).
until( has('code’, TXL') ).
limit(5).
path().by('code').
toList()
==> [RDU, JFK, TXL]
==> [RDU, LAX, TXL]
==> [RDU, MIA, TXL]
==> [RDU, YYZ, TXL]
==> [RDU, SFO, TXL]](https://image.slidesharecdn.com/exploringgraphusecases-180619230429/85/Exploring-Graph-Use-Cases-with-JanusGraph-13-320.jpg)
![Routing Considerations
14
What is the shortest path to Berlin?
DataWorks Summit San Jose / IBM Meetup / June 18, 2018 / © 2018 IBM Corporation
> g.V(rdu).
repeat( out('route').simplePath() ).
until( has('code’, TXL') ).
limit(5).
path().by('code').
toList()
==> [RDU, JFK, TXL]
==> [RDU, LAX, TXL]
==> [RDU, MIA, TXL]
==> [RDU, YYZ, TXL]
==> [RDU, SFO, TXL]
• Direction, Distance, Duration
• Country
• Hub airports
• Availability
• Price
Image credit: Apache TinkerPop, ALv2](https://image.slidesharecdn.com/exploringgraphusecases-180619230429/85/Exploring-Graph-Use-Cases-with-JanusGraph-14-320.jpg)
Exploring Graph Use Cases with JanusGraph
- 1. Exploring Graph Use Cases with JanusGraph Jason Plurad Open Source Developer & Advocate DataWorks Summit San Jose / IBM Meetup / June 18, 2018 / © 2018 IBM Corporation
- 2. Graphs are not new 2DataWorks Summit San Jose / IBM Meetup / June 18, 2018 / © 2018 IBM Corporation Image credit: Leonhard Euler, Solutio problematis ad geometriam situs pertinentis (1736), Public Domain
- 3. Property Graph Model 3DataWorks Summit San Jose / IBM Meetup / June 18, 2018 / © 2018 IBM Corporation Image credit: JanusGraph, CC by 4.0
- 4. Open Source Graph Stack 4DataWorks Summit San Jose / IBM Meetup / June 18, 2018 / © 2018 IBM Corporation Apache TinkerPop™ Maintainer The Apache Software Foundation License Apache Releases 3.3.3 May 2018 https://tinkerpop.apache.org JanusGraph™ Maintainer The Linux Foundation License Apache Releases 0.3.0 planned 2Q 2018 https://janusgraph.org
- 5. IBM Compose for JanusGraph 5DataWorks Summit San Jose / IBM Meetup / June 18, 2018 / © 2018 IBM Corporation https://www.compose.com/databases/janusgraph
- 6. Graph Data Use Cases 6 Social network analysis Configuration management database Master data management Recommendation engines Knowledge graphs Internet of things Cyber security attack analysis DataWorks Summit San Jose / IBM Meetup / June 18, 2018 / © 2018 IBM Corporation C A B D
- 7. Bill of Materials 7DataWorks Summit San Jose / IBM Meetup / June 18, 2018 / © 2018 IBM Corporation
- 8. Bill of Materials (BOM) 8DataWorks Summit San Jose / IBM Meetup / June 18, 2018 / © 2018 IBM Corporation Image credit: UK Government, Manual of Driving and Maintenance for Mechanical Vehicles (1937), Public Domain
- 9. BOM Hierarchy 9DataWorks Summit San Jose / IBM Meetup / June 18, 2018 / © 2018 IBM Corporation
- 10. BOM Traversals 10DataWorks Summit San Jose / IBM Meetup / June 18, 2018 / © 2018 IBM Corporation • Parent • Child • All parents • All children • All parents and children
- 11. Routing 11DataWorks Summit San Jose / IBM Meetup / June 18, 2018 / © 2018 IBM Corporation
- 12. Airline Reservations and Routing Jason • Raleigh (RDU) • Detroit (DTW) • Amsterdam (AMS) • Berlin (TXL) Chin • San Jose (SJC) • London (LHR) • Berlin (TXL) DataWorks Summit San Jose / IBM Meetup / June 18, 2018 / © 2018 IBM Corporation
- 13. Shortest Path with Gremlin 13 What is the shortest path to Berlin? DataWorks Summit San Jose / IBM Meetup / June 18, 2018 / © 2018 IBM Corporation Image credit: Apache TinkerPop, ALv2 > g.V(rdu). repeat( out('route').simplePath() ). until( has('code’, TXL') ). limit(5). path().by('code'). toList() ==> [RDU, JFK, TXL] ==> [RDU, LAX, TXL] ==> [RDU, MIA, TXL] ==> [RDU, YYZ, TXL] ==> [RDU, SFO, TXL]
- 14. Routing Considerations 14 What is the shortest path to Berlin? DataWorks Summit San Jose / IBM Meetup / June 18, 2018 / © 2018 IBM Corporation > g.V(rdu). repeat( out('route').simplePath() ). until( has('code’, TXL') ). limit(5). path().by('code'). toList() ==> [RDU, JFK, TXL] ==> [RDU, LAX, TXL] ==> [RDU, MIA, TXL] ==> [RDU, YYZ, TXL] ==> [RDU, SFO, TXL] • Direction, Distance, Duration • Country • Hub airports • Availability • Price Image credit: Apache TinkerPop, ALv2
- 15. 15 Start Exploring Graphs DOC ID / Month XX, 2018 / © 2018 IBM Corporation • Graph modeling is an iterative process • Graphs can become more interesting with a variety of connected data • Watch out for supernodes • When possible, start with the graph queries • The data might be structured as a graph, but solving the business problem doesn’t always require a graph database
- 16. 16 Thank you janusgraph.org tinkerpop.apache.org compose.com/databases/janusgraph github.com/IBM/janusgraph-utils developer.ibm.com/code/patterns twitter.com/pluradj Build on IBM Cloud for free with no time restrictions https://ibm.biz/BdZN6M DataWorks Summit San Jose / IBM Meetup / June 18, 2018 / © 2018 IBM Corporation
- 17. 17DataWorks Summit San Jose / IBM Meetup / June 18, 2018 / © 2018 IBM Corporation