Boneva, I. and Groz, B. and Hidders, Jan and Murlak, F. and Staworko, S. (2023) Static analysis of graph database transformations. In: UNSPECIFIED (ed.) PODS '23: Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. ACM, pp. 251-261. ISBN 9798400701276.
|
Text
static.pdf - Published Version of Record Available under License Creative Commons Attribution. Download (518kB) | Preview |
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.
Metadata
| Item Type: | Book Section |
|---|---|
| Additional Information: | SIGMOD/PODS '23: International Conference on Management of Data Seattle WA USA June 18 - 23, 2023 |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Research Centres and Institutes: | Birkbeck Knowledge Lab |
| Depositing User: | Jan Hidders |
| Date Deposited: | 22 May 2024 12:14 |
| Last Modified: | 17 Apr 2025 02:33 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/53500 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
