{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:49:42Z","timestamp":1773481782988,"version":"3.50.1"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/tkde.2020.3019817","type":"journal-article","created":{"date-parts":[[2020,8,28]],"date-time":"2020-08-28T00:16:26Z","timestamp":1598573786000},"page":"1-1","source":"Crossref","is-referenced-by-count":10,"title":["Strict and Flexible Rule-Based Graph Repairing"],"prefix":"10.1109","author":[{"given":"Yurong","family":"Cheng","sequence":"first","affiliation":[]},{"given":"Lei","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Ye","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Boyang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Fusheng","family":"Jin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.37"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti551"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1376916.1376940"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610494"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1138394.1138401"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915232"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824048"},{"key":"ref10","article-title":"An empirical study of real-world SPARQL queries","author":"Arias","year":"2011"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00075"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920878"},{"key":"ref13","first-page":"6","article-title":"Graph processing in RDBMSs","volume":"40","author":"Zhao","year":"2017"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.14778\/2535568.2448946"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-008-0141-y"},{"key":"ref16","volume-title":"Complexity Theory: Exploring the Limits of Efficient Algorithms","author":"Wegener","year":"2005"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735493"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2590989.2590991"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63385-5_30"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/MAHC.1985.10011"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2005.162.439"},{"key":"ref22","first-page":"99","article-title":"TEDI: Efficient shortest path query answering on graphs","author":"Fang","year":"2010","journal-title":"ACM Sigmod Int. Conf. Manage. Data"},{"key":"ref23","article-title":"TRANSIT: Ultrafast shortest-path queries with linear-time preprocessing","author":"Bast","year":"2006","journal-title":"9th DIMACS Implementation Challenge"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2014.12.005"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2506182.2506195"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68288-4_39"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488425"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1366102.1366103"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920870"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544847"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.14778\/2732967.2732974"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8867"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311907"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/42201.42203"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497500"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/4358933\/09179029.pdf?arnumber=9179029","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T23:17:02Z","timestamp":1704842222000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9179029\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/tkde.2020.3019817","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}