Gremlin

Gremlin is the graph traversal language of Apache TinkerPop. Gremlin is a functional, data-flow language that enables users to succinctly express complex traversals on (or queries of) their application's property graph. Every Gremlin traversal is composed of a sequence of (potentially nested) steps. A step performs an atomic operation on the data stream. Every step is either a map-step (transforming the objects in the stream), a filter-step (removing objects from the stream), or a sideEffect-step (computing statistics about the stream). The Gremlin step library extends on these 3-fundamental operations to provide users a rich collection of steps that they can compose in order to ask any conceivable question they may have of their data for Gremlin is Turing Complete.

• https://tinkerpop.apache.org/gremlin.html
• http://tinkerpop.apache.org/providers.html

GraphTraversal

One of the core concepts of tinkerpop/gremlin is the GraphTraversal It's interface has a generic definition as:

public interface GraphTraversal<S,E> extends Traversal<S,E>

and at https://markorodriguez.com/ the Author Marko Rodriguez explains the ideas behind using an generic approach vor handling Graphs. The Java implementation is available on github.

S is a generic Start class, and E is a generic End class as explained in the Apache Tinkerpop documentation.

A graph Traversal is the starting point for working with a graph. The convention is to name it

g

or

g()

The Modern example

Steps

What links here

• Graph Approaches for Software Engineeering
• Gremlin Basics
• Gremlin python
• ProceedingsTitleParser

Links

• That Conf - Graph Database - What, Why, How - Presentation by Andrew Glassmann
• Practical Gremlin: An Apache TinkerPop Tutorial by Kelvin Lawrence see also https://github.com/krlawrence/graph
• https://github.com/bechbd/gremlin-ide
• Tinkerpop

Stackoverflow Questions

• Difference between Graphs

Recipes

• Cycle Detection

Practical Gremlin: An Apache TinkerPop Tutorial by Kelvin Lawrence