{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T04:57:59Z","timestamp":1790225879798,"version":"4.1.0"},"reference-count":21,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation (NSF) of China","doi-asserted-by":"publisher","award":["61173025"],"award-info":[{"award-number":["61173025"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation (NSF) of China","doi-asserted-by":"publisher","award":["61373044"],"award-info":[{"award-number":["61373044"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF USA","award":["CCF-1017623"],"award-info":[{"award-number":["CCF-1017623"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2017]]},"DOI":"10.1109\/access.2017.2682107","type":"journal-article","created":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T05:07:43Z","timestamp":1489554463000},"page":"4551-4560","source":"Crossref","is-referenced-by-count":12,"title":["Efficient Graph Similarity Search in External Memory"],"prefix":"10.1109","volume":"5","author":[{"given":"Xiaoyang","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5436-1851","authenticated-orcid":false,"given":"Hongwei","family":"Huo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun","family":"Huan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeffrey Scott","family":"Vitter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1561\/0400000014"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.28"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.28"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-11-S3-S8"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516416"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.368956"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007607"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1189769.1189777"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687631"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.14778\/2732232.2732236"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102380"},{"key":"ref3","first-page":"6","article-title":"A graph distance metric combining maximum common subgraph and minimum common supergraph","volume":"22 nos","author":"fern\u00e1ndez","year":"2001","journal-title":"Pattern Recognit Lett"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920901"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2015.02.004"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.56"},{"key":"ref7","first-page":"326","article-title":"I\/O complexity: The red-blue pebble game","author":"hong","year":"1981","journal-title":"Proc STOC"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-010-9285-4"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497505"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.91"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2349924"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/6287639\/7859429\/7878573-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/7859429\/07878573.pdf?arnumber=7878573","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:53:53Z","timestamp":1649444033000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7878573\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/access.2017.2682107","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}