Gremlin was designed specifically for the analysis and manipulation of key/value-based, directed, multi-relational graphs. This long term refers to a type of graph data structure that has certain features. These features are described as follows. The first term, key/value, refers to the fact that both vertices and edges can have any number of properties associated with them. The second term, directed, refers to the fact that the edges in the graph have a directionality — that is, there is a tail and head to each edge. Finally, the third term, multi-relational, refers to the fact that there can many types of edges and thus, many types of relationships can exist between the vertices. For the remainder of this documentation, and for the sake of brevity, these types of graphs will be called property graphs. A property graph is demonstrated in the following example. This diagrammed property graph comes with the Gremlin distribution in GraphML format at
data/graph-example-1.xml (see graph-example-1.xml) or GraphSON at
data/graph-example-1.json (see graph-example-1.json)
A property graph has these elements:
Learn more about the property graph data model from Blueprints.