Core Concepts
GGDMiner automates the discovery of Graph Generating Dependencies to profile graph data efficiently.
Abstract
The content introduces GGDMiner, a framework for automatically discovering approximate GGDs from graph data to profile it effectively. The process involves pre-processing, candidate generation, and GGD extraction steps. It aims to provide insights into the relationships and attributes within property graphs.
Introduction
Definition of Data Dependencies.
Importance of Graph Data.
Graph Generating Dependencies (GGDs)
Expressive power in capturing constraints.
Comparison with other dependencies.
Examples of GGDs
Constraints on relations between nodes.
Constraints on attributes of graph patterns.
GGDMiner Framework
Pre-processing step for preparation.
Candidate generation using a lattice structure.
Utilization of Answer Graph for efficient operations.
Candidate Generation Algorithm
Lattice construction process.
Vertical and horizontal expansion methods.
Pre-processing Step
Selection of important attributes.
Construction of similarity indexes.
Data Extraction Metrics
No key metrics or figures mentioned in the content.
Quotations
No striking quotes found in the content.
Stats
No key metrics or figures mentioned in the content.
Quotes
No striking quotes found in the content.