Skip to next slide
You can skip to the next slide in
3
Ad
Skip to next slide
You can skip to the next slide in
3
Ad
Skip to next slide
You can skip to the next slide in
3
Ad
Skip to next slide
You can skip to the next slide in
3
Ad
Skip to next slide
You can skip to the next slide in
3
Ad
Skip to next slide
You can skip to the next slide in
3
Ad
Skip to next slide
You can skip to the next slide in
3
Ad
Skip to next slide
You can skip to the next slide in
3
Ad
Skip to next slide
You can skip to the next slide in
3
Ad
Skip to next slide
You can skip to the next slide in
3
Ad
Skip to next slide
You can skip to the next slide in
3
Ad
×
Your browser does not support the video tag.
Skip to next slide
Ad
×
Share Slideshare
LinkedIn
Facebook
Twitter
Embed
Size (px)
Show related Slideshows at end
WordPress Shortcode
Link
Share
Email
Small, Medium and Big Data
by Pierre De Wilde
3425 views
Vbug nov 2010 Visio Validation
by David Parker
1590 views
A survey of heterogeneous informati...
by SOYEON KIM
1448 views
Graph databases in PHP @ PHPCon Pol...
by Alessandro Nadalin
5994 views
Visio 2010 tips and techniques hand...
by Steven XU
8723 views
Sql saturday and share point saturd...
by David Parker
779 views
View on Slideshare
1
of
65
Ad
View on Slideshare
1
of
65
Ad
![Update a vertex
gremlin> v = g.getVertex(1)
==>v[1]
gremlin> v.ge...](https://image.slidesharecdn.com/awalkingraphdatabasesv1-0-120505073500-phpapp02/75/A-walk-in-graph-databases-v1-0-26-2048.jpg?cb=1668845549)
![Update an edge
gremlin> e = g.getEdge(8)
==>e[8][1-knows->4]
gremlin...](https://image.slidesharecdn.com/awalkingraphdatabasesv1-0-120505073500-phpapp02/75/A-walk-in-graph-databases-v1-0-27-2048.jpg?cb=1668845549)
![Remove a vertex
gremlin> v = g.getVertex(3)
==>v[3]
gremlin> g.rem...](https://image.slidesharecdn.com/awalkingraphdatabasesv1-0-120505073500-phpapp02/75/A-walk-in-graph-databases-v1-0-28-2048.jpg?cb=1668845549)
![Remove an edge
gremlin> e = g.getEdge(10)
==>e[10][4-created->5]
grem...](https://image.slidesharecdn.com/awalkingraphdatabasesv1-0-120505073500-phpapp02/75/A-walk-in-graph-databases-v1-0-29-2048.jpg?cb=1668845549)
![Graph traversal: starting the traversal
gremlin> g.v(1)
==>v[1]](https://image.slidesharecdn.com/awalkingraphdatabasesv1-0-120505073500-phpapp02/75/A-walk-in-graph-databases-v1-0-33-2048.jpg?cb=1668845549)
![Graph traversal: outgoing edges
gremlin> g.v(1).outE
==>e[7][1-knows->2]
...](https://image.slidesharecdn.com/awalkingraphdatabasesv1-0-120505073500-phpapp02/75/A-walk-in-graph-databases-v1-0-34-2048.jpg?cb=1668845549)
![Graph traversal: incoming vertices
gremlin> g.v(1).outE.inV
==>v[2]
...](https://image.slidesharecdn.com/awalkingraphdatabasesv1-0-120505073500-phpapp02/75/A-walk-in-graph-databases-v1-0-35-2048.jpg?cb=1668845549)
![Graph traversal: outgoing edges (cont.)
gremlin> g.v(1).outE.inV.outE
==>e[10]...](https://image.slidesharecdn.com/awalkingraphdatabasesv1-0-120505073500-phpapp02/75/A-walk-in-graph-databases-v1-0-36-2048.jpg?cb=1668845549)
![Graph traversal: starting vertex
gremlin> g.v(1)
==>v[1]](https://image.slidesharecdn.com/awalkingraphdatabasesv1-0-120505073500-phpapp02/75/A-walk-in-graph-databases-v1-0-39-2048.jpg?cb=1668845549)
![Graph traversal: adjacent vertices
gremlin> g.v(1).out
==>v[2]
...](https://image.slidesharecdn.com/awalkingraphdatabasesv1-0-120505073500-phpapp02/75/A-walk-in-graph-databases-v1-0-40-2048.jpg?cb=1668845549)
![Graph traversal: adjacent vertices (cont.)
gremlin> g.v(1).out.out
==>v[5]
...](https://image.slidesharecdn.com/awalkingraphdatabasesv1-0-120505073500-phpapp02/75/A-walk-in-graph-databases-v1-0-41-2048.jpg?cb=1668845549)
![Graph traversal: starting vertex
gremlin> g.v(1)
==>v[1]](https://image.slidesharecdn.com/awalkingraphdatabasesv1-0-120505073500-phpapp02/75/A-walk-in-graph-databases-v1-0-42-2048.jpg?cb=1668845549)
![Graph traversal: labeled outgoing edges
gremlin> g.v(1).outE('created')
==>e[9][...](https://image.slidesharecdn.com/awalkingraphdatabasesv1-0-120505073500-phpapp02/75/A-walk-in-graph-databases-v1-0-43-2048.jpg?cb=1668845549)
![Graph traversal and index
gremlin> g.idx('vertices')[[name:'marko']]
==>v[1]](https://image.slidesharecdn.com/awalkingraphdatabasesv1-0-120505073500-phpapp02/75/A-walk-in-graph-databases-v1-0-47-2048.jpg?cb=1668845549)
![Graph traversal and loop
gremlin> g.v(1).out.loop(1){it.loops<3}
==>v[5]
...](https://image.slidesharecdn.com/awalkingraphdatabasesv1-0-120505073500-phpapp02/75/A-walk-in-graph-databases-v1-0-52-2048.jpg?cb=1668845549)
![Graph traversal and path
gremlin> g.v(1).outE.inV.path
==>[v[1], e[7][1-knows->2...](https://image.slidesharecdn.com/awalkingraphdatabasesv1-0-120505073500-phpapp02/75/A-walk-in-graph-databases-v1-0-53-2048.jpg?cb=1668845549)
![Global traversal: in-degree distribution
gremlin> m=[:].withDefault{0}; g.V.
...](https://image.slidesharecdn.com/awalkingraphdatabasesv1-0-120505073500-phpapp02/75/A-walk-in-graph-databases-v1-0-54-2048.jpg?cb=1668845549)
