PG-Keys: Keys for Property Graphs

PG-Keys: Keys for Property Graphs
复制标题

DOI:
10.1145/3448016.3457561
复制
发表时间:
2021-06
期刊:
Proceedings of the 2021 International Conference on Management of Data
影响因子:
--
通讯作者:
Renzo Angles;A. Bonifati;Stefania Dumbrava;G. Fletcher;Keith W. Hare;J. Hidders;Victor E. Lee;Bei Li;L. Libkin;W. Martens;Filip Murlak;Josh Perryman;Ognjen Savkovic;Michael Schmidt;Juan Sequeda;Dominik Tomaszuk
Renzo Angles;A. Bonifati;Stefania Dumbrava;G. Fletcher;Keith W. Hare;J. Hidders;Victor E. Lee;Bei Li;L. Libkin;W. Martens;Filip Murlak;Josh Perryman;Ognjen Savkovic;Michael Schmidt;Juan Sequeda;Dominik Tomaszuk
中科院分区:
其他
文献类型:
--
作者:
Renzo Angles;A. Bonifati;Stefania Dumbrava;G. Fletcher;Keith W. Hare;J. Hidders;Victor E. Lee;Bei Li;L. Libkin;W. Martens;Filip Murlak;Josh Perryman;Ognjen Savkovic;Michael Schmidt;Juan Sequeda;Dominik Tomaszuk

文献摘要

相似文献

我们报告了工业界和学术界之间的社区努力,以塑造属性图约束的未来。属性图查询语言的标准化目前正在通过ISO图形查询语言(GQL)项目进行。我们的立场是,这个项目应该密切关注模式和约束,接下来应该关注关键约束。键的主要目的是加强数据完整性,并允许引用和标识对象。受行业合作伙伴用例的启发,我们认为关键约束应该能够具有不同的模式,这些模式是基本约束的组合,要求关键是独占的,强制的和单例的。此外,键应该适用于节点、边和属性,因为它们都可以表示有效的现实实体。我们的结果是PG-Keys,一个灵活而强大的定义关键约束的框架,它实现了上述目标。PG-Keys是由关联数据基准理事会的属性图模式工作组设计的,该工作组由来自行业,学术界和ISO GQL标准组的成员组成,旨在为属性图从业者带来最好的世界。PG-Keys旨在引导标准化工作的发展,使系统更有用,更强大,更有表现力。
We report on a community effort between industry and academia to shape the future of property graph constraints. The standardization for a property graph query language is currently underway through the ISO Graph Query Language (GQL) project. Our position is that this project should pay close attention to schemas and constraints, and should focus next on key constraints. The main purposes of keys are enforcing data integrity and allowing the referencing and identifying of objects. Motivated by use cases from our industry partners, we argue that key constraints should be able to have different modes, which are combinations of basic restriction that require the key to be exclusive, mandatory, and singleton. Moreover, keys should be applicable to nodes, edges, and properties since these all can represent valid real-life entities. Our result is PG-Keys, a flexible and powerful framework for defining key constraints, which fulfills the above goals. PG-Keys is a design by the Linked Data Benchmark Council's Property Graph Schema Working Group, consisting of members from industry, academia, and ISO GQL standards group, intending to bring the best of all worlds to property graph practitioners. PG-Keys aims to guide the evolution of the standardization efforts towards making systems more useful, powerful, and expressive.