Affiliation:
1. University of Edinburgh, Beihang University, and Shenzhen Institute of Computing Sciences
2. BDBC, Beihang University, Beijing, China
Abstract
This article proposes a class of dependencies for graphs, referred to as
graph entity dependencies
(GEDs). A GED is defined as a combination of a graph pattern and an attribute dependency. In a uniform format, GEDs can express graph functional dependencies with constant literals to catch inconsistencies, and keys carrying id literals to identify entities (vertices) 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, complete and independent 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 these extensions.
Funder
973 Program
Beijing Advanced Innovation Center for Big Data and Brain Computing
Foundation for Innovative Research Groups of NSFC
Joint Lab between Edinburgh and Huawei
NSFC
EPSRC
ERC
Publisher
Association for Computing Machinery (ACM)
Cited by
35 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献