The paper “GGDs: Graph Generating Dependencies” by Larissa Shimomura, George Fletcher and Nikolay Yakovets will be presented at the CIKM 2020 conference on October 21. The conference program can be found here, while the paper can be accessed here.

Graph Generating Dependencies (GGDs) is 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. The paper provides the formal definition of GGDs, analyzes the validation problem for GGDs, and demonstrates the practical utility of GGDs.