G-CORE a core for future graph query languages

Renzo Angles; Marcelo Arenas; Pablo Barceló; Peter Boncz; George Fletcher; Claudio Gutierrez; Tobias Lindaaker; Marcus Paradies; Stefan Plantikow; Juan Sequeda; Oskar van Rest; Hannes Voigt

doi:10.1145/3183713.3190654

G-CORE a core for future graph query languages

Renzo Angles
, Marcelo Arenas
, Pablo Barceló
, Peter Boncz
, George Fletcher
, Claudio Gutierrez
, Tobias Lindaaker
, Marcus Paradies
, Stefan Plantikow
, Juan Sequeda
, Oskar van Rest
, Hannes Voigt

Database Group

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/Congresprocedure › Conferentiebijdrage › Academic › peer review

155 Citaten (Scopus)

Samenvatting

We report on a community effort between industry and academia to shape the future of graph query languages. We argue that existing graph database management systems should consider supporting a query language with two key characteristics. First, it should be composable, meaning, that graphs are the input and the output of queries. Second, the graph query language should treat paths as first-class citizens. Our result is G-CORE, a powerful graph query language design that fulfills these goals, and strikes a careful balance between path query expressivity and evaluation complexity.

Originele taal-2	Engels
Titel	SIGMOD 2018 - Proceedings of the 2018 International Conference on Management of Data
Redacteuren	Gautam Das, Christopher Jermaine, Ahmed Eldawy, Philip Bernstein
Plaats van productie	New York
Uitgeverij	Association for Computing Machinery, Inc.
Pagina's	1421-1432
Aantal pagina's	12
ISBN van elektronische versie	978-1-4503-4703-7
DOI's	https://doi.org/10.1145/3183713.3190654
Status	Gepubliceerd - 27 mei 2018
Evenement	44th ACM SIGMOD International Conference on Management of Data, SIGMOD 2018 - Houston, Verenigde Staten van Amerika Duur: 10 jun. 2018 → 15 jun. 2018

Congres

Congres	44th ACM SIGMOD International Conference on Management of Data, SIGMOD 2018
Land/Regio	Verenigde Staten van Amerika
Stad	Houston
Periode	10/06/18 → 15/06/18

Toegang tot document

10.1145/3183713.3190654

Andere bestanden en links

Link to publication in Scopus

Citeer dit

Angles, R., Arenas, M., Barceló, P., Boncz, P., Fletcher, G., Gutierrez, C., Lindaaker, T., Paradies, M., Plantikow, S., Sequeda, J., van Rest, O., & Voigt, H. (2018). G-CORE a core for future graph query languages. In G. Das, C. Jermaine, A. Eldawy, & P. Bernstein (editors), SIGMOD 2018 - Proceedings of the 2018 International Conference on Management of Data (blz. 1421-1432). Association for Computing Machinery, Inc.. https://doi.org/10.1145/3183713.3190654

@inproceedings{1d5df18a8c114bb186c0855251ad435a,

title = "G-CORE a core for future graph query languages",

abstract = "We report on a community effort between industry and academia to shape the future of graph query languages. We argue that existing graph database management systems should consider supporting a query language with two key characteristics. First, it should be composable, meaning, that graphs are the input and the output of queries. Second, the graph query language should treat paths as first-class citizens. Our result is G-CORE, a powerful graph query language design that fulfills these goals, and strikes a careful balance between path query expressivity and evaluation complexity.",

keywords = "Graph data models, Graph databases, Graph query languages, graph data models, graph query languages",

author = "Renzo Angles and Marcelo Arenas and Pablo Barcel{\'o} and Peter Boncz and George Fletcher and Claudio Gutierrez and Tobias Lindaaker and Marcus Paradies and Stefan Plantikow and Juan Sequeda and \{van Rest\}, Oskar and Hannes Voigt",

year = "2018",

month = may,

day = "27",

doi = "10.1145/3183713.3190654",

language = "English",

pages = "1421--1432",

editor = "Gautam Das and Christopher Jermaine and Ahmed Eldawy and Philip Bernstein",

booktitle = "SIGMOD 2018 - Proceedings of the 2018 International Conference on Management of Data",

publisher = "Association for Computing Machinery, Inc.",

address = "United States",

note = "44th ACM SIGMOD International Conference on Management of Data, SIGMOD 2018 ; Conference date: 10-06-2018 Through 15-06-2018",

}

Angles, R, Arenas, M, Barceló, P, Boncz, P, Fletcher, G, Gutierrez, C, Lindaaker, T, Paradies, M, Plantikow, S, Sequeda, J, van Rest, O & Voigt, H 2018, G-CORE a core for future graph query languages. in G Das, C Jermaine, A Eldawy & P Bernstein (reds.), SIGMOD 2018 - Proceedings of the 2018 International Conference on Management of Data. Association for Computing Machinery, Inc., New York, blz. 1421-1432, 44th ACM SIGMOD International Conference on Management of Data, SIGMOD 2018, Houston, Verenigde Staten van Amerika, 10/06/18. https://doi.org/10.1145/3183713.3190654

G-CORE a core for future graph query languages. / Angles, Renzo; Arenas, Marcelo; Barceló, Pablo et al.
SIGMOD 2018 - Proceedings of the 2018 International Conference on Management of Data. reds. / Gautam Das; Christopher Jermaine; Ahmed Eldawy; Philip Bernstein. New York: Association for Computing Machinery, Inc., 2018. blz. 1421-1432.

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/Congresprocedure › Conferentiebijdrage › Academic › peer review

TY - GEN

T1 - G-CORE a core for future graph query languages

AU - Angles, Renzo

AU - Arenas, Marcelo

AU - Barceló, Pablo

AU - Boncz, Peter

AU - Fletcher, George

AU - Gutierrez, Claudio

AU - Lindaaker, Tobias

AU - Paradies, Marcus

AU - Plantikow, Stefan

AU - Sequeda, Juan

AU - van Rest, Oskar

AU - Voigt, Hannes

PY - 2018/5/27

Y1 - 2018/5/27

N2 - We report on a community effort between industry and academia to shape the future of graph query languages. We argue that existing graph database management systems should consider supporting a query language with two key characteristics. First, it should be composable, meaning, that graphs are the input and the output of queries. Second, the graph query language should treat paths as first-class citizens. Our result is G-CORE, a powerful graph query language design that fulfills these goals, and strikes a careful balance between path query expressivity and evaluation complexity.

AB - We report on a community effort between industry and academia to shape the future of graph query languages. We argue that existing graph database management systems should consider supporting a query language with two key characteristics. First, it should be composable, meaning, that graphs are the input and the output of queries. Second, the graph query language should treat paths as first-class citizens. Our result is G-CORE, a powerful graph query language design that fulfills these goals, and strikes a careful balance between path query expressivity and evaluation complexity.

KW - Graph data models

KW - Graph databases

KW - Graph query languages

KW - graph data models

KW - graph query languages

UR - https://www.scopus.com/pages/publications/85048456889

U2 - 10.1145/3183713.3190654

DO - 10.1145/3183713.3190654

M3 - Conference contribution

AN - SCOPUS:85048456889

SP - 1421

EP - 1432

BT - SIGMOD 2018 - Proceedings of the 2018 International Conference on Management of Data

A2 - Das, Gautam

A2 - Jermaine, Christopher

A2 - Eldawy, Ahmed

A2 - Bernstein, Philip

PB - Association for Computing Machinery, Inc.

CY - New York

T2 - 44th ACM SIGMOD International Conference on Management of Data, SIGMOD 2018

Y2 - 10 June 2018 through 15 June 2018

ER -

G-CORE a core for future graph query languages

Samenvatting

Congres

Toegang tot document

Andere bestanden en links

Vingerafdruk

Citeer dit