Recommended
More Related Content
Viewers also liked
Similar to In The Land Of Graphs...
Similar to In The Land Of Graphs... (20)
More from Fernand Galiana
Recently uploaded
Recently uploaded (20)
In The Land Of Graphs...
- 1. In the land of graphs Fernand Galiana @kitesurfer
- 5. Agenda • Graph morphology • Persistence mechanisms • Terminology • Modeling • Graph databases and API’s • Integrating with Ruby/Rails • How to win $1,000,000
- 11. Property Graph (present) followsfollows likes likes name: Fred age: 29 name: Jim age: 19
- 12. Property Graph (cont) followsfollows likes likes name: Fred age: 29 name: James age: 19 weight: 0.9 date: 11/12/13
- 13. @jimweirich
- 14. Persistence
- 15. Any database can model a graph
- 16. Index Base Traversal DC E A B B,C E E,D CB D E A
- 17. DC E A B B,C E E,D CB D E A Index Base Traversal
- 18. DC E A B B,C E E,D CB D E A Index Base Traversal
- 19. DC E A B B,C E E,D CB D E A Index Base Traversal
- 20. A graph database is any storage system that can provide index-free adjacency.
- 21. GraphDB DC E A B
- 22. GraphDB DC E A B
- 23. Performance Depth SQL Neo4j Recs 2 0.01 0.01 2.5k 3 30.26 0.16 100k 4 1,543 1.35 600k 5 Toast! 2.1 800k
- 24. @jimweirich
- 25. Why use a graph DB? • Recommendations - densifying the graph • Social • Ranking • Merging domains • Data analysis
- 26. Terminology
- 28. Terminology 1 2 follows 3 likes loves OUT Vertex IN Vertex
- 29. Terminology 1 2 follows 3 likes loves vertex 1 OUT edges
- 30. Terminology 1 2 follows 3 likes loves vertex 2 IN edges
- 31. Terminology 1 2 follows 3 likes loves vertex 3 BOTH edges
- 32. @jimweirich
- 33. Modeling A B
- 34. Modeling • Vertex • Edge • Properties • Relationships
- 35. Modeling • Assess the space • Nodes = Entities • Edges = connections + semantic context • NProperties = entity attrs + meta • EProperties = strength + weight
- 36. @jimweirich
- 37. The Scene …
- 38. DSLs • Cypher (Neo4j) • Gremlin (BluePrint) • SPARQL
- 39. Rexster • Rexster (REST) • RexPro (bin) • Rexster Kibbles
- 40. Blueprints
- 41. Gremlin
- 42. Gremlin[CruD] • g.addVertex(id,[a:10,b:’Hello’]) • g.addEdge(id,v1,v2,’friend’,[a:10]) • g.removeVertex(g.v(id)) • g.removeEdge(g.e(id)) • g.v(id).remove() • …
- 43. 2 4 5 6 7 1 3 Oscar Rango BatisteGustave Gertrude Stew Olaf friend friend friend friend friend friend friend friend gremlin> g = rexster.getGraph('derailed_graph')
- 44. 2 4 5 6 7 1 3 Oscar Rango BatisteGustave Gertrude Stew Olaf friend friend friend friend friend friend friend friend gremlin> g.V ==> v[1], v[2], v[3], v[4], v[5], v[6], v[7]
- 45. gremlin> g.E ==> e[1][1-friend-2], e[2][1-friend-3], etc… 2 4 5 6 7 1 3 Oscar Rango BatisteGustave Gertrude Stew Olaf friend friend friend friend friend friend friend friend
- 47. 2 4 5 6 7 1 3 Oscar Rango BatisteGustave Gertrude Stew Olaf friend friend friend friend friend friend friend friend gremlin> g.V(‘name’, ‘Gustave’) ==> v[1]
- 48. 2 4 5 6 7 1 3 Oscar Rango BatisteGustave Gertrude Stew Olaf friend friend friend friend friend friend friend friend gremlin> g.e(1) ==> e[1][1-friend-2]
- 49. gremlin> g.v(1).outE ==> e[1][1-friend-2], e[2][1-friend-3],e[3][1-friend-4] 2 4 5 6 7 1 3 Oscar Rango BatisteGustave Gertrude Stew Olaf friend friend friend friend friend friend friend friend
- 50. gremlin> g.v(7).inE ==> e[7][3-friend-7] 2 4 5 6 7 1 3 Oscar Rango BatisteGustave Gertrude Stew Olaf friend friend friend friend friend friend friend friend
- 51. gremlin> g.v(4).bothE ==> e[3][1-friend-4], e[8][4-friend-6] 2 4 5 6 7 1 3 Oscar Rango BatisteGustave Gertrude Stew Olaf friend friend friend friend friend friend friend friend
- 54. 2 4 5 6 7 1 3 Oscar Rango BatisteGustave Gertrude Stew Olaf friend friend friend friend friend friend friend friend gremlin> g.v(1).out(‘friend’) ==> v[2], v[3], v[4]
- 55. 2 4 5 6 7 1 3 Oscar Rango BatisteGustave Gertrude Stew Olaf friend friend friend friend friend friend friend friend gremlin> g.v(1).out(‘friend’).out(‘friend’) ==> v[5], v[6], v[6], v[6], v[7]
- 56. 2 4 5 6 7 1 3 Oscar Rango BatisteGustave Gertrude Stew Olaf friend friend friend friend friend friend friend friend gremlin> g.v(1).out(‘friend’).out(‘friend’).groupCount.cap ==> {v[5]=1,v[6]=3,v[7]=1}
- 57. DEMO! • Rexster DogHouse • Wewoo (coz self promotion is underated!)
- 58. @jimweirich
- 59. Conclusion • Mining relationships • Recommendation, data analysis • Scoring, Ranking • Understand problem space • Search engine integration • Combining several problem spaces
- 60. References • https://github.com/tinkerpop/gremlin • http://gremlindocs.com • http://sql2gremlin.com • github.com/derailed/wewoo • @jimweirich
- 61. Is a Graph worth a thousand joins? ! ! ! Thank you! @kitesurfer fernand.galiana@gmail.com