GGDs: Graph Generating Dependencies

2020/04/21 by Larissa C. Shimomura, Shimomura, Larissa C., George Fletcher +3 · 1 citation
Computer Science · Decision Sciences · #Advanced Database Systems and Queries #Data Quality and Management #Databases (cs.DB) #FOS: Computer and information sciences #H.2 #Semantic Web and Ontologies

paper · pdf · doi:10.48550/arxiv.2004.10247

openalex publication_date 2020/04/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

• Graph functional dependencies: Analysis and translation to PG-schema

Related

• Reasoning on Property Graphs with Graph Generating Dependencies
• Discovering Graph Generating Dependencies for Property Graph Profiling
• An Efficient Approach for Discovering Graph Entity Dependencies (GEDs)
• FASTAGEDS: Fast Approximate Graph Entity Dependency Discovery
• Analyzing Graph Transformation Systems through Constraint Handling Rules