Formalizing Gremlin pattern matching traversals in an integrated graph Algebra
dc.bibliographicCitation.firstPage | 2 | |
dc.bibliographicCitation.volume | 2599 | |
dc.contributor.author | Thakkar, Harsh | |
dc.contributor.author | Auer, Sören | |
dc.contributor.author | Vidal, Maria-Esther | |
dc.contributor.editor | Samavi, Reza | |
dc.contributor.editor | Consens, Mariano P. | |
dc.contributor.editor | Khatchadourian, Shahan | |
dc.contributor.editor | Nguyen, Vinh | |
dc.contributor.editor | Sheth, Amit | |
dc.contributor.editor | Giménez-García, José M. | |
dc.contributor.editor | Thakkar, Harsh | |
dc.date.accessioned | 2022-09-01T04:42:29Z | |
dc.date.available | 2022-09-01T04:42:29Z | |
dc.date.issued | 2019 | |
dc.description.abstract | Graph data management (also called NoSQL) has revealed beneficial characteristics in terms of flexibility and scalability by differ-ently balancing between query expressivity and schema flexibility. This peculiar advantage has resulted into an unforeseen race of developing new task-specific graph systems, query languages and data models, such as property graphs, key-value, wide column, resource description framework (RDF), etc. Present-day graph query languages are focused towards flex-ible graph pattern matching (aka sub-graph matching), whereas graph computing frameworks aim towards providing fast parallel (distributed) execution of instructions. The consequence of this rapid growth in the variety of graph-based data management systems has resulted in a lack of standardization. Gremlin, a graph traversal language, and machine provide a common platform for supporting any graph computing sys-tem (such as an OLTP graph database or OLAP graph processors). In this extended report, we present a formalization of graph pattern match-ing for Gremlin queries. We also study, discuss and consolidate various existing graph algebra operators into an integrated graph algebra. | eng |
dc.description.version | publishedVersion | eng |
dc.identifier.uri | https://oa.tib.eu/renate/handle/123456789/10127 | |
dc.identifier.uri | http://dx.doi.org/10.34657/9165 | |
dc.language.iso | eng | eng |
dc.publisher | Aachen, Germany : RWTH Aachen | |
dc.relation.essn | 1613-0073 | |
dc.relation.ispartof | BlockSW-CKG 2019: BlockSW and CKG Workshops at ISWC 2019 | |
dc.relation.ispartofseries | CEUR workshop proceedings ; 2599 | |
dc.relation.uri | http://ceur-ws.org/Vol-2599/CKG2019_paper_2.pdf | |
dc.rights.license | CC BY 4.0 Unported | |
dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | |
dc.subject | Graph Pattern Matching | eng |
dc.subject | Graph Traversal | eng |
dc.subject | Gremlin | eng |
dc.subject | Graph Algebra | eng |
dc.subject | Konferenzschrift | ger |
dc.subject.ddc | 004 | |
dc.title | Formalizing Gremlin pattern matching traversals in an integrated graph Algebra | eng |
dc.type | bookPart | eng |
dc.type | Text | eng |
dcterms.bibliographicCitation.journalTitle | CEUR workshop proceedings | |
tib.accessRights | openAccess | eng |
tib.relation.conference | Blockchain enabled Semantic Web Workshop (BlockSW) and Contextualized Knowledge Graphs (CKG) Workshop co-located with the 18th International Semantic Web Conference (ISWC 2019), 27.10.2019, Auckland, New Zealand | |
wgl.contributor | TIB | |
wgl.subject | Informatik | ger |
wgl.type | Buchkapitel / Sammelwerksbeitrag | ger |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Formalizing_Gremlin_pattern.pdf
- Size:
- 1.37 MB
- Format:
- Adobe Portable Document Format
- Description: