PG-Keys: Keys for Property Graphs

Autor: Keith W. Hare, George H. L. Fletcher, Sławek Staworko, Michael Schmidt, Leonid Libkin, Jan Hidders, Stefania Dumbrava, Angela Bonifati, Victor E. Lee, Bei Li, Filip Murlak, Juan F. Sequeda, Wim Martens, Ognjen Savkovic, Dominik Tomaszuk, Renzo Angles, Josh Perryman
Přispěvatelé: Universidad de Talaca, Université Claude Bernard Lyon 1 - Faculté des sciences (UCBL FS), Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon, Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS), Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE), Institut Polytechnique de Paris (IP Paris), Eindhoven University of Technology [Eindhoven] (TU/e), JCC Consulting Inc, Neo4j, Birkbeck College [University of London], TigerGraph, Google LLC, Laboratory for the Foundations of Computer Science [Edinburgh] (LFCS), University of Edinburgh, École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL), University of Bayreuth, Uniwersytet Warszawski, Interos Inc., Free University of Bozen-Bolzano, Amazon Web Services [Seattle] (AWS), data.world, Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Linking Dynamic Data (LINKS), Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), University of Bialystok, Réponse efficace aux requêtes sous mises à jourEQUUS - ANR-19-CE48-0019AAPG2019 - 2019, Université Claude Bernard Lyon 1 - Faculté des sciences et technologies (UCBL FST), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2), École normale supérieure - Paris (ENS Paris), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
Jazyk: angličtina
Rok vydání: 2021
Předmět:
Zdroj: ACM Special Interest Group on Management of Data (SIGMOD)
ACM Special Interest Group on Management of Data (SIGMOD), Jun 2021, Xi'an, China. ⟨10.1145/3448016.3457561⟩
Angles, R, Bonifati, A, Dumbrava, S, Fletcher, G, Hare, K W, Hidders, J, Lee, V E, Li, B, Libkin, L, Martens, W, Murlak, F, Perryman, J, Savković, O, Schmidt, M, Sequeda, J, Staworko, S & Tomaszuk, D 2021, PG-Keys: Keys for Property Graphs . in Proceedings of the 2021 International Conference on Management of Data (SIGMOD ’21) . pp. 2423-2436, ACM SIGMOD/PODS International Conference on Management Data, Xi'an, China, 20/06/21 . https://doi.org/10.1145/3448016.3457561
SIGMOD Conference
Popis: International audience; 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. CCS CONCEPTS • Information systems → Integrity checking; • Theory of computation → Data modeling; Database constraints theory.
Databáze: OpenAIRE
Externí odkaz: