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.
|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|
|Number of pages||4|
|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
|Name||International Conference on Information and Knowledge Management, Proceedings|
|Conference||29th ACM International Conference on Information and Knowledge Management (CIKM) - 2020|
|Period||19/10/20 → 23/01/21|
Bibliographical noteDBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.
- equality-generating dependencies
- graph dependencies
- property graphs
- tuple-generating dependencies