Dependencies for Graphs

Author:

Fan Wenfei1,Lu Ping2

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)

Subject

Information Systems

Cited by 35 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. An efficient approach for discovering Graph Entity Dependencies (GEDs);Information Systems;2024-11

2. Reasoning on property graphs with graph generating dependencies;Information Sciences;2024-06

3. Implementation Strategies for Views over Property Graphs;Proceedings of the ACM on Management of Data;2024-05-29

4. Towards User-Centric Graph Repairs;2024 IEEE 40th International Conference on Data Engineering Workshops (ICDEW);2024-05-13

5. Heterogeneous graph neural networks for fraud detection and explanation in supply chain finance;Information Systems;2024-03

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3