{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:34:41Z","timestamp":1754156081043,"version":"3.41.2"},"reference-count":27,"publisher":"Emerald","issue":"6","license":[{"start":{"date-parts":[[2021,8,19]],"date-time":"2021-08-19T00:00:00Z","timestamp":1629331200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJWIS"],"published-print":{"date-parts":[[2021,12,1]]},"abstract":"<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title>\n<jats:p>Graph rewriting concerns the technique of transforming a graph; it is thus natural to conceive its application in the evolution of graph databases. This paper aims to propose a two-step framework where rewriting rules formalize instance or schema changes, ensuring graph\u2019s consistency with respect to constraints, and updates are managed by ensuring rule applicability through the generation of side effects: new updates which guarantee that rule application conditions hold.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title>\n<jats:p>This paper proposes Schema Evolution Through UPdates, optimized version (SetUp<jats:sub>OPT<\/jats:sub>), a theoretical and applied framework for the management of resource description framework (RDF)\/S database evolution on the basis of graph rewriting rules. The framework is an improvement of SetUp which avoids the computation of superfluous side effects and proposes, via <jats:inline-formula id=\"ieq3a\">\n<jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"IJWIS-03-2021-003301.tif\"\/>\n<m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\"><m:mrow><m:mi mathvariant=\"normal\">SetU<\/m:mi><m:msubsup><m:mi mathvariant=\"normal\">p<\/m:mi><m:mrow><m:mi mathvariant=\"normal\">opt<\/m:mi><\/m:mrow><m:mrow><m:mi>N<\/m:mi><m:mi>D<\/m:mi><\/m:mrow><\/m:msubsup><\/m:mrow><\/m:math><\/jats:inline-formula>, a flexible and extensible package of solutions to deal with non-determinism.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Findings<\/jats:title>\n<jats:p>This paper shows graph rewriting into a practical and useful application which ensures consistent evolution of RDF databases. It introduces an optimised approach for dealing with side effects and a flexible and customizable way of dealing with non-determinism. Experimental evaluation of <jats:inline-formula id=\"ieq3b\">\n<jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"IJWIS-03-2021-003302.tif\"\/>\n<m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\"><m:mrow><m:mi mathvariant=\"normal\">SetU<\/m:mi><m:msubsup><m:mi mathvariant=\"normal\">p<\/m:mi><m:mrow><m:mi mathvariant=\"normal\">opt<\/m:mi><\/m:mrow><m:mrow><m:mi>N<\/m:mi><m:mi>D<\/m:mi><\/m:mrow><\/m:msubsup><\/m:mrow><\/m:math><\/jats:inline-formula> demonstrates the importance of the proposed optimisations as they significantly reduce side-effect generation and limit data degradation.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title>\n<jats:p>SetUp originality lies in the use of graph rewriting techniques under the closed world assumption to set an updating system which preserves database consistency. Efficiency is ensured by avoiding the generation of superfluous side effects. Flexibility is guaranteed by offering different solutions for non-determinism and allowing the integration of customized choice functions.<\/jats:p>\n<\/jats:sec>","DOI":"10.1108\/ijwis-03-2021-0033","type":"journal-article","created":{"date-parts":[[2021,8,18]],"date-time":"2021-08-18T13:20:54Z","timestamp":1629292854000},"page":"622-644","source":"Crossref","is-referenced-by-count":3,"title":["Graph rewriting rules for RDF database evolution: optimizing side-effect processing"],"prefix":"10.1108","volume":"17","author":[{"given":"Jacques","family":"Chabin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9dric","family":"Eichler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mirian","family":"Halfeld Ferrari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Hiot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2021,8,19]]},"reference":[{"article-title":"Updating RDFS ABoxes and TBoxes in SPARQL","volume-title":"CoRR","year":"2014","key":"key2021112917082326800_ref001"},{"year":"2012","key":"key2021112917082326800_ref002","article-title":"Graphical schema editing for stardog OWL\/RDF databases using OWLGrEd\/S. 849, 01"},{"key":"key2021112917082326800_ref003","unstructured":"Chabin, J., Eichler, C., Halfeld Ferrari, M. and Hiot, N. (2019a), \u201cSetUp: a tool for consistent updates of RDF knowledge graphs\u201d, available at: https:\/\/www.univ-orleans.fr\/lifo\/evenements\/sendup-project\/index.php\/softwares\/setup-schema-evolution-through-updates\/"},{"issue":"4","key":"key2021112917082326800_ref004","article-title":"Consistent updating of databases with marked nulls","volume":"62","year":"2019","journal-title":"Knowledge and Information Systems"},{"key":"key2021112917082326800_ref005","unstructured":"Chabin, J., Eichler, C., Halfeld Ferrari, M. and Hiot, N. (2020a), \u201cGraph rewriting system for consistent evolution of RDF databases\u201d, Technical report, LIFO, Universit\u00e9 d\u2019Orl\u00e9ans, INSA Centre Val de Loire, available at: hal.archives-ouvertes.fr\/hal-02560325v3"},{"key":"key2021112917082326800_ref006","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1145\/3428757.3429126","article-title":"Graph rewriting rules for rdf database evolution management","volume-title":"Proceedings of the 22nd International Conference on Information Integration and Web-Based Applications and Services, iiWAS \u201820","year":"2020"},{"key":"key2021112917082326800_ref007","first-page":"44","article-title":"Using graph transformation to support collaborative ontology evolution","volume-title":"Applications of Graph Transformations with Industrial Relevance","year":"2008"},{"issue":"1","key":"key2021112917082326800_ref008","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s10115-012-0500-2","article-title":"Formal foundations for RDF\/S KB evolution","volume":"35","year":"2013","journal-title":"Knowledge and Information Systems"},{"first-page":"299","article-title":"Efficient query answering against dynamic RDF databases","year":"2013","key":"key2021112917082326800_ref009"},{"issue":"1","key":"key2021112917082326800_ref010","article-title":"A visual interpreter semantics for statecharts based on amalgamated graph transformation","volume":"39","year":"2011","journal-title":"ECEASST"},{"first-page":"93","article-title":"RDFS update: from theory to practice","year":"2011","key":"key2021112917082326800_ref011"},{"issue":"2","key":"key2021112917082326800_ref012","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1017\/S0960129508007202","article-title":"Correctness of high-level transformation systems relative to nested conditions","volume":"19","year":"2009","journal-title":"Mathematical Structures in Computer Science"},{"issue":"3\/4","key":"key2021112917082326800_ref013","first-page":"287","article-title":"Graph grammars with negative application conditions","volume":"26","year":"1996","journal-title":"Fundamenta Informaticae"},{"first-page":"357","article-title":"Updating RDF\/S databases under constraints","year":"2017","key":"key2021112917082326800_ref014"},{"article-title":"Logic of belief revision","volume-title":"The Stanford Encyclopedia of Philosophy","year":"2016","key":"key2021112917082326800_ref015"},{"issue":"1\/2","key":"key2021112917082326800_ref016","first-page":"181","article-title":"Algebraic approach to single-pushout graph transformation","volume":"109","year":"1993","journal-title":"Theoretical Computer Science"},{"key":"key2021112917082326800_ref017","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/j.knosys.2014.10.007","article-title":"Algebraic graph transformations for formalizing ontology changes and evolving ontologies","volume":"73","year":"2015","journal-title":"Knowledge-Based Systems"},{"key":"key2021112917082326800_ref018","first-page":"187","article-title":"Consistency evaluation of RDF data: How data and updates are relevant","volume-title":"Tenth International Conference on Signal-Image Technology and Internet-Based Systems, SITIS 2014","year":"2014"},{"key":"key2021112917082326800_ref019","first-page":"81","article-title":"AGG 2.0 \u2013 new features for specifying and analyzing algebraic graph transformations","volume-title":"Applications of Graph Transformations with Industrial Relevance","year":"2012"},{"issue":"3","key":"key2021112917082326800_ref020","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.jcss.2006.10.003","article-title":"Automata for XML - A survey","volume":"73","year":"2007","journal-title":"Journal of Computer and System Sciences"},{"first-page":"489","volume-title":"Automated Merging of Feature Models Using Graph Transformations","year":"2008","key":"key2021112917082326800_ref021"},{"first-page":"607","article-title":"Containment and minimization of RDF\/S query patterns","year":"2005","key":"key2021112917082326800_ref022"},{"issue":"1","key":"key2021112917082326800_ref023","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1504\/IJDMB.2015.066334","article-title":"Managing changes in distributed biomedical ontologies using hierarchical distributed graph transformation","volume":"11","year":"2015","journal-title":"International Journal of Data Mining and Bioinformatics"},{"year":"2008","key":"key2021112917082326800_ref024","article-title":"Opening, closing worlds \u2013 on integrity constraints"},{"key":"key2021112917082326800_ref025","first-page":"446","article-title":"AGG: a graph transformation environment for modeling and validation of software","volume-title":"International Workshop on Applications of Graph Transformations with Industrial Relevance","year":"2003"},{"year":"2010","key":"key2021112917082326800_ref026","article-title":"Integrity constraints in OWL"},{"volume-title":"Updating Logical Databases","year":"1990","key":"key2021112917082326800_ref027"}],"container-title":["International Journal of Web Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJWIS-03-2021-0033\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJWIS-03-2021-0033\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T22:23:51Z","timestamp":1753395831000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijwis\/article\/17\/6\/622-644\/445124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,19]]},"references-count":27,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2021,8,19]]},"published-print":{"date-parts":[[2021,12,1]]}},"alternative-id":["10.1108\/IJWIS-03-2021-0033"],"URL":"https:\/\/doi.org\/10.1108\/ijwis-03-2021-0033","relation":{},"ISSN":["1744-0084","1744-0084"],"issn-type":[{"type":"print","value":"1744-0084"},{"type":"print","value":"1744-0084"}],"subject":[],"published":{"date-parts":[[2021,8,19]]}}}