Consistency and Certain Answers in Relational to RDF Data Exchange with Shape Constraints

Boneva, Iovka; Staworko, Sławek; Lozano, José María Caballero

doi:10.1007/978-3-030-54623-6_9

Cited by 2 publications

(1 citation statement)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Regarding transformations defined by schema mappings, if the mapping does not define target constraints, then the target schema is simply a relational signature and type checking is reduced to trivial syntactic check, and as such it is irrelevant. This is most often the case for graph schema mappings [7,13], with seldom exceptions such as [10] for mapping relational to graph-shaped data. Their notion of consistency is related to type checking, but is studied for a simpler formalism without path queries.…”

Section: Related Workmentioning

confidence: 99%

Static Analysis of Graph Database Transformations

Boneva,

Groz,

Hidders

et al. 2023

Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

View full text Add to dashboard Cite

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. CCS CONCEPTS• Theory of computation → Logic and databases.

show abstract

Section: Related Workmentioning

confidence: 99%