Static Analysis of Graph Database Transformations

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, w...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2023-04
Main Authors: Boneva, Iovka, Groz, Benoit, Hidders, Jan, Murlak, Filip, Staworko, Slawomir
Format: Article
Language:English
Subjects:
Containment
Lower bounds
Transformations
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Boneva, Iovka
Groz, Benoit
Hidders, Jan
Murlak, Filip
Staworko, Slawomir
description 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.
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2799920117</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2799920117</sourcerecordid><originalsourceid>FETCH-proquest_journals_27999201173</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mQwDC5JLMlMVnDMS8ypLM4sVshPU3AvSizIUHBJLElMSixOVQgpSswrTssvygUqzM8r5mFgTUvMKU7lhdLcDMpuriHOHroFRfmFpanFJfFZ-aVFQOOK443MLS0tjQwMDc2NiVMFAJwQM4Y</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2799920117</pqid></control><display><type>article</type><title>Static Analysis of Graph Database Transformations</title><source>Publicly Available Content Database</source><creator>Boneva, Iovka ; Groz, Benoit ; Hidders, Jan ; Murlak, Filip ; Staworko, Slawomir</creator><creatorcontrib>Boneva, Iovka ; Groz, Benoit ; Hidders, Jan ; Murlak, Filip ; Staworko, Slawomir</creatorcontrib><description>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.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Containment ; Lower bounds ; Transformations</subject><ispartof>arXiv.org, 2023-04</ispartof><rights>2023. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2799920117?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>780,784,25753,37012,44590</link.rule.ids></links><search><creatorcontrib>Boneva, Iovka</creatorcontrib><creatorcontrib>Groz, Benoit</creatorcontrib><creatorcontrib>Hidders, Jan</creatorcontrib><creatorcontrib>Murlak, Filip</creatorcontrib><creatorcontrib>Staworko, Slawomir</creatorcontrib><title>Static Analysis of Graph Database Transformations</title><title>arXiv.org</title><description>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.</description><subject>Containment</subject><subject>Lower bounds</subject><subject>Transformations</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mQwDC5JLMlMVnDMS8ypLM4sVshPU3AvSizIUHBJLElMSixOVQgpSswrTssvygUqzM8r5mFgTUvMKU7lhdLcDMpuriHOHroFRfmFpanFJfFZ-aVFQOOK443MLS0tjQwMDc2NiVMFAJwQM4Y</recordid><startdate>20230420</startdate><enddate>20230420</enddate><creator>Boneva, Iovka</creator><creator>Groz, Benoit</creator><creator>Hidders, Jan</creator><creator>Murlak, Filip</creator><creator>Staworko, Slawomir</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20230420</creationdate><title>Static Analysis of Graph Database Transformations</title><author>Boneva, Iovka ; Groz, Benoit ; Hidders, Jan ; Murlak, Filip ; Staworko, Slawomir</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_27999201173</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Containment</topic><topic>Lower bounds</topic><topic>Transformations</topic><toplevel>online_resources</toplevel><creatorcontrib>Boneva, Iovka</creatorcontrib><creatorcontrib>Groz, Benoit</creatorcontrib><creatorcontrib>Hidders, Jan</creatorcontrib><creatorcontrib>Murlak, Filip</creatorcontrib><creatorcontrib>Staworko, Slawomir</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Boneva, Iovka</au><au>Groz, Benoit</au><au>Hidders, Jan</au><au>Murlak, Filip</au><au>Staworko, Slawomir</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Static Analysis of Graph Database Transformations</atitle><jtitle>arXiv.org</jtitle><date>2023-04-20</date><risdate>2023</risdate><eissn>2331-8422</eissn><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.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2023-04
issn 2331-8422
language eng
recordid cdi_proquest_journals_2799920117
source Publicly Available Content Database
subjects Containment
Lower bounds
Transformations
title Static Analysis of Graph Database Transformations
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T12%3A31%3A40IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Static%20Analysis%20of%20Graph%20Database%20Transformations&rft.jtitle=arXiv.org&rft.au=Boneva,%20Iovka&rft.date=2023-04-20&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2799920117%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_27999201173%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2799920117&rft_id=info:pmid/&rfr_iscdi=true