Proceedings of the 15th Symposium on Database Programming Languages 2015
DOI: 10.1145/2815072.2815073
|View full text |Cite
|
Sign up to set email alerts
|

The Gremlin graph traversal machine and language (invited talk)

Abstract: Gremlin is a graph traversal machine and language designed, developed, and distributed by the Apache TinkerPop project. Gremlin, as a graph traversal machine, is composed of three interacting components: a graph G, a traversal Ψ, and a set of traversers T . The traversers move about the graph according to the instructions specified in the traversal, where the result of the computation is the ultimate locations of all halted traversers. A Gremlin machine can be executed over any supporting graph computing syste… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
110
0
3

Year Published

2016
2016
2023
2023

Publication Types

Select...
4
3
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 168 publications
(113 citation statements)
references
References 15 publications
0
110
0
3
Order By: Relevance
“…It does not return what the path is nor the length of the shortest path -only whether there is such a path. By probing against different path lengths, this limitation can be overcome by a query similar to the following, which returns the shortest route (routes with the least steps) between <room1> and <room2> (with maximum length of three steps for brevity): Gremlin [16], as a graph traversal language, is a functional language. The purpose of the language is to enable a human user to easily define a traversal, which is a tree of functions called steps, and thus, program a Gremlin machine.…”
Section: Discussionmentioning
confidence: 99%
“…It does not return what the path is nor the length of the shortest path -only whether there is such a path. By probing against different path lengths, this limitation can be overcome by a query similar to the following, which returns the shortest route (routes with the least steps) between <room1> and <room2> (with maximum length of three steps for brevity): Gremlin [16], as a graph traversal language, is a functional language. The purpose of the language is to enable a human user to easily define a traversal, which is a tree of functions called steps, and thus, program a Gremlin machine.…”
Section: Discussionmentioning
confidence: 99%
“…Communication between Web applications and the Cayley Graph Database is implemented via Gremlin queries. Gremlin (TinkerPop, first release: ; Rodriguez, ) is a domain specific language for traversing property graphs.…”
Section: Background Knowledge and Technical Detailsmentioning
confidence: 99%
“…The TinkerPop framework aims to define a standard data model for property graphs. For graph queries, it provides the Gremlin Structure API, a low-level programming interface and the Gremlin language, a high-level imperative graph traversal language [31]. The latter is implemented as a Groovy DSL [20].…”
Section: Graph Query Languagesmentioning
confidence: 99%