Dependencies for Graphs Article Swipe
Related Concepts
Computer science
Dependency graph
Dependency (UML)
Graph
Theoretical computer science
Functional dependency
Clique-width
Line graph
Voltage graph
Data mining
Artificial intelligence
Relational database
Wenfei Fan
,
Ping Lü
·
YOU?
·
· 2017
· Open Access
·
· DOI: https://doi.org/10.1145/3034786.3056114
· OA: W2612176352
YOU?
·
· 2017
· Open Access
·
· DOI: https://doi.org/10.1145/3034786.3056114
· OA: W2612176352
This paper proposes a class of dependencies for graphs, referred to as graph entity dependencies (GEDs). A GED is a combination of a graph pattern and an attribute dependency. In a uniform format, GEDs express graph functional dependencies with constant literals to catch inconsistencies, and keys carrying id literals to identify entities in a graph.
Related Topics
Finding more related topics…