{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T22:38:17Z","timestamp":1778279897900,"version":"3.51.4"},"reference-count":48,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,5,3]],"date-time":"2024-05-03T00:00:00Z","timestamp":1714694400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100018693","name":"Horizon Europe","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100018693","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1016\/j.ins.2024.120675","type":"journal-article","created":{"date-parts":[[2024,5,6]],"date-time":"2024-05-06T16:16:38Z","timestamp":1715012198000},"page":"120675","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Reasoning on property graphs with graph generating dependencies"],"prefix":"10.1016","volume":"672","author":[{"given":"Larissa C.","family":"Shimomura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolay","family":"Yakovets","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2111-6769","authenticated-orcid":false,"given":"George","family":"Fletcher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2024.120675_br0010","series-title":"Proceedings of the 16th International Conference on Database Theory, ICDT '13","first-page":"189","article-title":"Schema mappings and data exchange for graph databases","author":"Barcel\u00f3","year":"2013"},{"key":"10.1016\/j.ins.2024.120675_br0020","series-title":"2007 IEEE 23rd International Conference on Data Engineering","first-page":"746","article-title":"Conditional functional dependencies for data cleaning","author":"Bohannon","year":"2007"},{"key":"10.1016\/j.ins.2024.120675_br0030","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01892-3","article-title":"Foundations of Data Quality Management","author":"Fan","year":"2012"},{"issue":"2","key":"10.1016\/j.ins.2024.120675_br0040","article-title":"Dependencies for graphs: challenges and opportunities","volume":"11","author":"Fan","year":"2019","journal-title":"J. Data Inf. Qual."},{"issue":"2","key":"10.1016\/j.ins.2024.120675_br0050","doi-asserted-by":"crossref","DOI":"10.1145\/3287285","article-title":"Dependencies for graphs","volume":"44","author":"Fan","year":"2019","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/j.ins.2024.120675_br0060","series-title":"Proceedings of the 2016 International Conference on Management of Data, SIGMOD '16","first-page":"1843","article-title":"Functional dependencies for graphs","author":"Fan","year":"2016"},{"key":"10.1016\/j.ins.2024.120675_br0070","series-title":"Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS '17","first-page":"389","article-title":"Schema mappings for data graphs","author":"Francis","year":"2017"},{"key":"10.1016\/j.ins.2024.120675_br0080","series-title":"Data Cleaning","author":"Ilyas","year":"2019"},{"key":"10.1016\/j.ins.2024.120675_br0090","series-title":"Querying Graphs","author":"Bonifati","year":"2018"},{"issue":"6","key":"10.1016\/j.ins.2024.120675_br0100","doi-asserted-by":"crossref","first-page":"653","DOI":"10.14778\/3311880.3311883","article-title":"Certus: an effective entity resolution approach with graph differential dependencies (gdds)","volume":"12","author":"Kwashie","year":"2019","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.ins.2024.120675_br0110","series-title":"Proceedings of the 29th ACM International Conference on Information and Knowledge Management, CIKM '20","first-page":"2217","article-title":"Ggds: graph generating dependencies","author":"Shimomura","year":"2020"},{"issue":"3","key":"10.1016\/j.ins.2024.120675_br0120","doi-asserted-by":"crossref","DOI":"10.1145\/2000824.2000826","article-title":"Differential dependencies: reasoning and discovery","volume":"36","author":"Song","year":"2011","journal-title":"ACM Trans. Database Syst."},{"issue":"2","key":"10.1016\/j.ins.2024.120675_br0130","doi-asserted-by":"crossref","DOI":"10.1145\/1366102.1366103","article-title":"Conditional functional dependencies for capturing data inconsistencies","volume":"33","author":"Fan","year":"2008","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/j.ins.2024.120675_br0140","series-title":"Databases Theory and Applications","first-page":"50","article-title":"Mining differential dependencies: a subspace clustering approach","author":"Kwashie","year":"2014"},{"key":"10.1016\/j.ins.2024.120675_br0150","series-title":"Databases Theory and Applications","first-page":"3","article-title":"Efficient discovery of differential dependencies through association rules mining","author":"Kwashie","year":"2015"},{"issue":"9","key":"10.1016\/j.ins.2024.120675_br0160","doi-asserted-by":"crossref","first-page":"2179","DOI":"10.1109\/TKDE.2013.84","article-title":"Efficient determination of distance thresholds for differential dependencies","volume":"26","author":"Song","year":"2014","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"10.1016\/j.ins.2024.120675_br0170","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1145\/1634.1636","article-title":"A proof procedure for data dependencies","volume":"31","author":"Beeri","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/j.ins.2024.120675_br0180","series-title":"Database Theory \u2014 ICDT 2003","first-page":"207","article-title":"Data exchange: semantics and query answering","author":"Fagin","year":"2003"},{"key":"10.1016\/j.ins.2024.120675_br0190","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.tcs.2013.11.002","article-title":"Extending inclusion dependencies with conditions","volume":"515","author":"Ma","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ins.2024.120675_br0200","series-title":"Proceedings of the 28th ACM International Conference on Information and Knowledge Management, CIKM '19","first-page":"219","article-title":"Inclusion dependency discovery: an experimental evaluation of thirteen algorithms","author":"D\u00fcrsch","year":"2019"},{"key":"10.1016\/j.ins.2024.120675_br0210","series-title":"Proceedings of the 2016 International Conference on Management of Data, SIGMOD '16","first-page":"953","article-title":"Rdfind: scalable conditional inclusion dependency discovery in rdf datasets","author":"Kruse","year":"2016"},{"key":"10.1016\/j.ins.2024.120675_br0220","series-title":"Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","first-page":"128","article-title":"Chasing constrained tuple-generating dependencies","author":"Maher","year":"1996"},{"key":"10.1016\/j.ins.2024.120675_br0230","series-title":"2018 IEEE 34th International Conference on Data Engineering (ICDE)","first-page":"773","article-title":"Rule-based graph repairing: semantic and efficient repairing methods","author":"Cheng","year":"2018"},{"issue":"12","key":"10.1016\/j.ins.2024.120675_br0240","doi-asserted-by":"crossref","first-page":"1502","DOI":"10.14778\/2824032.2824048","article-title":"Association rules with graph patterns","volume":"8","author":"Fan","year":"2015","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.ins.2024.120675_br0250","series-title":"Temporal graph functional dependencies","author":"Alipourlangouri","year":"2022"},{"key":"10.1016\/j.ins.2024.120675_br0260","series-title":"2020 IEEE\/ACM International Conference on Big Data Computing, Applications and Technologies (BDCAT)","first-page":"27","article-title":"Large-scale data integration using graph probabilistic dependencies (gpds)","author":"Zada","year":"2020"},{"key":"10.1016\/j.ins.2024.120675_br0270","series-title":"Proceedings of the Ninth Annual ACM Symposium on Theory of Computing, STOC '77","first-page":"77","article-title":"Optimal implementation of conjunctive queries in relational data bases","author":"Chandra","year":"1977"},{"issue":"5","key":"10.1016\/j.ins.2024.120675_br0280","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-031-01893-0","article-title":"Incomplete data and data dependencies in relational databases","volume":"4","author":"Greco","year":"2012","journal-title":"Synth. Lect. Data Manag."},{"key":"10.1016\/j.ins.2024.120675_br0290","series-title":"Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS '15","first-page":"91","article-title":"Chase termination for guarded existential rules","author":"Calautti","year":"2015"},{"key":"10.1016\/j.ins.2024.120675_br0300","series-title":"Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS '20","first-page":"245","article-title":"All-instances restricted chase termination","author":"Gogacz","year":"2020"},{"issue":"1","key":"10.1016\/j.ins.2024.120675_br0310","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.tcs.2004.10.033","article-title":"Data exchange: semantics and query answering","volume":"336","author":"Fagin","year":"2005","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ins.2024.120675_br0320","series-title":"Computational Complexity, Theoretical Computer Science","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/j.ins.2024.120675_br0330","series-title":"Proceedings of the 14th International Conference on Database Theory, ICDT '11","first-page":"244","article-title":"The complexity of evaluating tuple generating dependencies","author":"Pichler","year":"2011"},{"issue":"1","key":"10.1016\/j.ins.2024.120675_br0340","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","article-title":"On the complexity of h-coloring","volume":"48","author":"Hell","year":"1990","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.ins.2024.120675_br0350","series-title":"STACS 2001","first-page":"407","article-title":"The complexity of minimal satisfiability problems","author":"Kirousis","year":"2001"},{"issue":"1","key":"10.1016\/j.ins.2024.120675_br0360","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1137\/S0097539794266766","article-title":"The computational structure of monotone monadic snp and constraint satisfaction: a study through datalog and group theory","volume":"28","author":"Feder","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.ins.2024.120675_br0370","series-title":"Computational Complexity: A Modern Approach","author":"Arora","year":"2009"},{"issue":"2","key":"10.1016\/j.ins.2024.120675_br0380","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1007\/s00778-019-00558-9","article-title":"An analytical study of large SPARQL query logs","volume":"29","author":"Bonifati","year":"2020","journal-title":"VLDB J."},{"issue":"1","key":"10.1016\/j.ins.2024.120675_br0390","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/spe.4380120103","article-title":"Backtrack search algorithms and the maximal common subgraph problem","volume":"12","author":"McGregor","year":"1982","journal-title":"Softw. Pract. Exp."},{"key":"10.1016\/j.ins.2024.120675_br0400","series-title":"Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC '78","first-page":"265","article-title":"On the complexity of the maximum subgraph problem","author":"Lewis","year":"1978"},{"issue":"1","key":"10.1016\/j.ins.2024.120675_br0410","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(00)00286-3","article-title":"Enumerating all connected maximal common subgraphs in two graphs","volume":"250","author":"Koch","year":"2001","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"10.1016\/j.ins.2024.120675_br0420","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/4236.877487","article-title":"The semantic web: the roles of xml and rdf","volume":"4","author":"Decker","year":"2000","journal-title":"IEEE Internet Comput."},{"key":"10.1016\/j.ins.2024.120675_br0430","series-title":"Proceedings of the 2018 International Conference on Management of Data, SIGMOD '18","first-page":"1421","article-title":"G-core: a core for future graph query languages","author":"Angles","year":"2018"},{"key":"10.1016\/j.ins.2024.120675_br0440","series-title":"Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data, SIGMOD '11","first-page":"133","article-title":"Designing and refining schema mappings via data examples","author":"Alexe","year":"2011"},{"key":"10.1016\/j.ins.2024.120675_br0450","series-title":"Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology, EDBT '08","first-page":"85","article-title":"Schema mapping verification: the spicy way","author":"Bonifati","year":"2008"},{"issue":"9","key":"10.1016\/j.ins.2024.120675_br0460","doi-asserted-by":"crossref","first-page":"961","DOI":"10.14778\/3329772.3329774","article-title":"Balance-aware distributed string similarity-based query processing system","volume":"12","author":"Sun","year":"2019","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.ins.2024.120675_br0470","series-title":"The Semantic Web - ISWC 2006","first-page":"30","article-title":"Semantics and complexity of sparql","author":"P\u00e9rez","year":"2006"},{"issue":"8","key":"10.1016\/j.ins.2024.120675_br0480","doi-asserted-by":"crossref","first-page":"625","DOI":"10.14778\/2732296.2732299","article-title":"String similarity joins: an experimental evaluation","volume":"7","author":"Jiang","year":"2014","journal-title":"Proc. VLDB Endow."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025524005887?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025524005887?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T16:27:29Z","timestamp":1715963249000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025524005887"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6]]},"references-count":48,"alternative-id":["S0020025524005887"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2024.120675","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2024,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Reasoning on property graphs with graph generating dependencies","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2024.120675","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 The Author(s). Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"120675"}}