Static Analysis of Graph Database Transformations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

Static Analysis of Graph Database Transformations

Abstract

We investigate graph transformations, defined using Datalog-like rules based on acyclic conjunctive two-way regular path queries (acyclic C2RPQs), and we study two fundamental static analysis problems: type checking and equivalence of transformations in the presence of graph schemas. Additionally, we investigate the problem of target schema elicitation, which aims to construct a schema that closely captures all outputs of a transformation over graphs conforming to the input schema. We show all these problems are in EXPTIME by reducing them to C2RPQ containment modulo schema; we also provide matching lower bounds. We use cycle reversing to reduce query containment to the problem of unrestricted (finite or infinite) satisfiability of C2RPQs modulo a theory expressed in a description logic.
Fichier principal
Vignette du fichier
main.pdf (885.35 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03937274 , version 1 (06-04-2023)
hal-03937274 , version 2 (17-04-2023)

Licence

Attribution

Identifiers

  • HAL Id : hal-03937274 , version 2

Cite

Iovka Boneva, Benoit Groz, Jan Hidders, Filip Murlak, Slawomir Staworko. Static Analysis of Graph Database Transformations. Symposium on Principles of Database Systems, Jun 2023, Seattle, United States. ⟨hal-03937274v2⟩
201 View
64 Download

Share

Gmail Facebook X LinkedIn More