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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

8 Citations (Scopus)

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.

Original language	English
Title of host publication	CIKM '20: Proceedings of the 29th ACM International Conference on Information & Knowledge Management
Place of Publication	New York
Publisher	Association for Computing Machinery, Inc
Pages	2217-2220
Number of pages	4
ISBN (Electronic)	9781450368599
ISBN (Print)	978-1-4503-6859-9
DOIs	https://doi.org/10.1145/3340531.3412149
Publication status	Published - 19 Oct 2020
Event	29th ACM International Conference on Information and Knowledge Management (CIKM) - 2020 - Duration: 19 Oct 2020 → 23 Jan 2021

Conference

Conference	29th ACM International Conference on Information and Knowledge Management (CIKM) - 2020
Abbreviated title	CIKM
Period	19/10/20 → 23/01/21

Keywords

equality-generating dependencies
graph dependencies
property graphs
tuple-generating dependencies

Access to Document

10.1145/3340531.3412149

Cite this

@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, pp. 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. p. 2217-2220.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › 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 - http://www.scopus.com/inward/record.url?scp=85095863305&partnerID=8YFLogxK

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

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this