GGDs : Graph Generating Dependencies

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review


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 languageEnglish
Title of host publicationCIKM '20: Proceedings of the 29th ACM International Conference on Information & Knowledge Management
Place of PublicationNew York
PublisherAssociation for Computing Machinery, Inc
Number of pages4
ISBN (Electronic)9781450368599
ISBN (Print)978-1-4503-6859-9
Publication statusPublished - 19 Oct 2020
Event29th ACM International Conference on Information and Knowledge Management (CIKM) - 2020 -
Duration: 19 Oct 202023 Jan 2021

Publication series

NameInternational Conference on Information and Knowledge Management, Proceedings


Conference29th ACM International Conference on Information and Knowledge Management (CIKM) - 2020
Abbreviated titleCIKM

Bibliographical note

DBLP's bibliographic metadata records provided through 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

Fingerprint Dive into the research topics of 'GGDs : Graph Generating Dependencies'. Together they form a unique fingerprint.

Cite this