GGDs: Graph Generating Dependencies
Larissa C. Shimomura (Eindhoven University of Technology), George, Fletcher (Eindhoven University of Technology), Nikolay Yakovets (Eindhoven, University of Technology)
TL;DR
This paper introduces Graph Generating Dependencies (GGDs), a new formalism for expressing complex constraints on property graphs, enhancing the expressivity and practical utility in graph data management.
Contribution
The paper formally defines GGDs, analyzes their validation problem, and demonstrates their practical usefulness in managing property graph constraints.
Findings
GGDs extend existing constraint languages for property graphs.
Validation of GGDs is formally analyzed.
GGDs are shown to be practically useful in graph data management.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSemantic Web and Ontologies · Advanced Database Systems and Queries · Data Quality and Management