Details
| Originalsprache | Englisch |
|---|---|
| Titel des Sammelwerks | BlockSW and CKG Workshops at ISWC 2019 |
| Untertitel | Proceedings of the Blockchain enabled Semantic Web Workshop (BlockSW) and Contextualized Knowledge Graphs (CKG) Workshop co-located with the 18th International Semantic Web Conference (ISWC 2019) |
| Publikationsstatus | Veröffentlicht - 2019 |
| Veranstaltung | 2019 Blockchain Enabled Semantic Web Workshop and Contextualized Knowledge Graphs Workshop: BlockSW-CKG 2019 - Auckland, Neuseeland Dauer: 27 Okt. 2019 → 27 Okt. 2019 |
Publikationsreihe
| Name | CEUR Workshop Proceedings |
|---|---|
| Herausgeber (Verlag) | CEUR Workshop Proceedings |
| Band | 2599 |
| ISSN (Print) | 1613-0073 |
Abstract
Graph data management (also called NoSQL) has revealed beneficial characteristics in terms of flexibility and scalability by differently 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 flexible 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 system (such as an OLTP graph database or OLAP graph processors). In this extended report, we present a formalization of graph pattern matching for Gremlin queries. We also study, discuss and consolidate various existing graph algebra operators into an integrated graph algebra.
ASJC Scopus Sachgebiete
- Informatik (insg.)
- Allgemeine Computerwissenschaft
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
BlockSW and CKG Workshops at ISWC 2019: Proceedings of the Blockchain enabled Semantic Web Workshop (BlockSW) and Contextualized Knowledge Graphs (CKG) Workshop co-located with the 18th International Semantic Web Conference (ISWC 2019). 2019. (CEUR Workshop Proceedings; Band 2599).
Publikation: Beitrag in Buch/Bericht/Sammelwerk/Konferenzband › Aufsatz in Konferenzband › Forschung › Peer-Review
}
TY - GEN
T1 - Formalizing Gremlin pattern matching traversals in an integrated graph Algebra
AU - Thakkar, Harsh
AU - Auer, Sören
AU - Vidal, Maria Esther
N1 - Funding Information: This work is supported by the funding received from EU-H2020 Frame- work Programme under grant agreement No. 780732 (BOOST4.0)
PY - 2019
Y1 - 2019
N2 - Graph data management (also called NoSQL) has revealed beneficial characteristics in terms of flexibility and scalability by differently 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 flexible 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 system (such as an OLTP graph database or OLAP graph processors). In this extended report, we present a formalization of graph pattern matching for Gremlin queries. We also study, discuss and consolidate various existing graph algebra operators into an integrated graph algebra.
AB - Graph data management (also called NoSQL) has revealed beneficial characteristics in terms of flexibility and scalability by differently 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 flexible 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 system (such as an OLTP graph database or OLAP graph processors). In this extended report, we present a formalization of graph pattern matching for Gremlin queries. We also study, discuss and consolidate various existing graph algebra operators into an integrated graph algebra.
KW - Graph Algebra
KW - Graph Pattern Matching
KW - Graph Traversal
KW - Gremlin
UR - http://www.scopus.com/inward/record.url?scp=85093851344&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85093851344
T3 - CEUR Workshop Proceedings
BT - BlockSW and CKG Workshops at ISWC 2019
T2 - 2019 Blockchain Enabled Semantic Web Workshop and Contextualized Knowledge Graphs Workshop, BlockSW-CKG 2019
Y2 - 27 October 2019 through 27 October 2019
ER -