@inproceedings{fb2594b271d8440ab7e5f88708d498e4,
title = "Dependencies for graphs",
abstract = "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. We revise the chase for GEDs and prove its Church-Rosser property. We characterize GED satisfiability and implication, and establish the complexity of these problems and the validation problem for GEDs, in the presence and absence of constant literals and id literals. We also develop a sound and complete axiom system for finite implication of GEDs. In addition, we extend GEDs with built-in predicates or disjunctions, to strike a balance between the expressive power and complexity. We settle the complexity of the satisfiability, implication and validation problems for the extensions.",
keywords = "Axiom system, Built-in predicates, Conditional functional dependencies, Disjunction, EGDs, Graph dependencies, Implication, Keys, Satisfiability, TGDs, Validation",
author = "Wenfei Fan and Ping Lu",
note = "Publisher Copyright: {\textcopyright} 2017 ACM.; 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017 ; Conference date: 14-05-2017 Through 19-05-2017",
year = "2017",
month = may,
day = "9",
doi = "10.1145/3034786.3056114",
language = "英语",
series = "Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems",
publisher = "Association for Computing Machinery ",
pages = "403--416",
booktitle = "PODS 2017 - Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems",
address = "美国",
}