GGDs : Graph Generating Dependencies

Larissa Capobianco Shimomura; George Fletcher; Nikolay Yakovets

doi:10.1145/3340531.3412149

GGDs : Graph Generating Dependencies

Larissa Capobianco Shimomura, George Fletcher, Nikolay Yakovets

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

11 Citaten (Scopus)

Samenvatting

We propose Graph Generating Dependencies (GGDs), a new class of dependencies for property graphs. Extending the expressivity of state of the art constraint languages, GGDs can express both tuple- and equality-generating dependencies on property graphs, both of which find broad application in graph data management. We provide the formal definition of GGDs, analyze the validation problem for GGDs, and demonstrate the practical utility of GGDs.

Originele taal-2	Engels
Titel	CIKM '20: Proceedings of the 29th ACM International Conference on Information & Knowledge Management
Plaats van productie	New York
Uitgeverij	Association for Computing Machinery, Inc.
Pagina's	2217-2220
Aantal pagina's	4
ISBN van elektronische versie	9781450368599
ISBN van geprinte versie	978-1-4503-6859-9
DOI's	https://doi.org/10.1145/3340531.3412149
Status	Gepubliceerd - 19 okt. 2020
Evenement	29th ACM International Conference on Information and Knowledge Management (CIKM) - 2020 - Duur: 19 okt. 2020 → 23 jan. 2021

Congres

Congres	29th ACM International Conference on Information and Knowledge Management (CIKM) - 2020
Verkorte titel	CIKM
Periode	19/10/20 → 23/01/21

Toegang tot document

10.1145/3340531.3412149

Andere bestanden en links

Link to publication in Scopus

Citeer dit

@inproceedings{30c7bcbe88a04ffda9aa916f530ee153,

title = "GGDs : Graph Generating Dependencies",

abstract = "We propose Graph Generating Dependencies (GGDs), a new class of dependencies for property graphs. Extending the expressivity of state of the art constraint languages, GGDs can express both tuple- and equality-generating dependencies on property graphs, both of which find broad application in graph data management. We provide the formal definition of GGDs, analyze the validation problem for GGDs, and demonstrate the practical utility of GGDs.",

keywords = "equality-generating dependencies, graph dependencies, property graphs, tuple-generating dependencies",

author = "Shimomura, \{Larissa Capobianco\} and George Fletcher and Nikolay Yakovets",

year = "2020",

month = oct,

day = "19",

doi = "10.1145/3340531.3412149",

language = "English",

isbn = "978-1-4503-6859-9",

pages = "2217--2220",

booktitle = "CIKM '20: Proceedings of the 29th ACM International Conference on Information \& Knowledge Management",

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

address = "United States",

note = "29th ACM International Conference on Information and Knowledge Management (CIKM) - 2020, CIKM ; Conference date: 19-10-2020 Through 23-01-2021",

}

Shimomura, LC, Fletcher, G & Yakovets, N 2020, GGDs : Graph Generating Dependencies. in CIKM '20: Proceedings of the 29th ACM International Conference on Information & Knowledge Management. Association for Computing Machinery, Inc., New York, blz. 2217-2220, 29th ACM International Conference on Information and Knowledge Management (CIKM) - 2020, 19/10/20. https://doi.org/10.1145/3340531.3412149

GGDs : Graph Generating Dependencies. / Shimomura, Larissa Capobianco; Fletcher, George ; Yakovets, Nikolay.
CIKM '20: Proceedings of the 29th ACM International Conference on Information & Knowledge Management. New York: Association for Computing Machinery, Inc., 2020. blz. 2217-2220.

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

TY - GEN

T1 - GGDs : Graph Generating Dependencies

AU - Shimomura, Larissa Capobianco

AU - Fletcher, George

AU - Yakovets, Nikolay

PY - 2020/10/19

Y1 - 2020/10/19

N2 - We propose Graph Generating Dependencies (GGDs), a new class of dependencies for property graphs. Extending the expressivity of state of the art constraint languages, GGDs can express both tuple- and equality-generating dependencies on property graphs, both of which find broad application in graph data management. We provide the formal definition of GGDs, analyze the validation problem for GGDs, and demonstrate the practical utility of GGDs.

AB - We propose Graph Generating Dependencies (GGDs), a new class of dependencies for property graphs. Extending the expressivity of state of the art constraint languages, GGDs can express both tuple- and equality-generating dependencies on property graphs, both of which find broad application in graph data management. We provide the formal definition of GGDs, analyze the validation problem for GGDs, and demonstrate the practical utility of GGDs.

KW - equality-generating dependencies

KW - graph dependencies

KW - property graphs

KW - tuple-generating dependencies

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

U2 - 10.1145/3340531.3412149

DO - 10.1145/3340531.3412149

M3 - Conference contribution

SN - 978-1-4503-6859-9

SP - 2217

EP - 2220

BT - CIKM '20: Proceedings of the 29th ACM International Conference on Information & Knowledge Management

PB - Association for Computing Machinery, Inc.

CY - New York

T2 - 29th ACM International Conference on Information and Knowledge Management (CIKM) - 2020

Y2 - 19 October 2020 through 23 January 2021

ER -

GGDs : Graph Generating Dependencies

Samenvatting

Congres

Toegang tot document

Andere bestanden en links

Vingerafdruk

Citeer dit