{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T17:59:20Z","timestamp":1773511160750,"version":"3.50.1"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61741215"],"award-info":[{"award-number":["61741215"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61373044"],"award-info":[{"award-number":["61373044"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation 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\/100000001","name":"U.S. National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1017623"],"award-info":[{"award-number":["CCF-1017623"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2021,6,1]]},"DOI":"10.1109\/tkde.2019.2954527","type":"journal-article","created":{"date-parts":[[2019,11,20]],"date-time":"2019-11-20T16:13:15Z","timestamp":1574266395000},"page":"2654-2668","source":"Crossref","is-referenced-by-count":10,"title":["MSQ-Index: A Succinct Index for Fast Graph Similarity Search"],"prefix":"10.1109","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1858-2400","authenticated-orcid":false,"given":"Xiaoyang","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5436-1851","authenticated-orcid":false,"given":"Hongwei","family":"Huo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Huan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey Scott","family":"Vitter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1200-7368","authenticated-orcid":false,"given":"Weiguo","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8586-4400","authenticated-orcid":false,"given":"Lei","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2349924"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0487-0"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2007.1024"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.28"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516416"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.28"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0306-1"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687631"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1109\/69.956106","article-title":"A graph-based approach for discovering various types of association rules","volume":"13","author":"yen","year":"2001","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007607"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(01)00017-4"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2015.02.004"},{"key":"ref12","first-page":"256","article-title":"CSI–GED: An efficient approach for graph edit similarity computation","author":"gouda","year":"2016","journal-title":"Proc Int Conf Data Eng"},{"key":"ref13","first-page":"841","article-title":"High-order entropy-compressed text indexes","author":"grossi","year":"2003","journal-title":"Proc 14th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2014.49"},{"key":"ref17","author":"jacobson","year":"1989","journal-title":"Succinct Data Structures"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.152"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.14778\/2535569.2448952"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447846"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-010-0212-8"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38221-5_15"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2772243"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2682107"},{"key":"ref29","first-page":"1660","article-title":"Fast subtree kernels on graphs","author":"shervashidze","year":"2009","journal-title":"Proc 22nd Int Conf Neural Inf Process Syst"},{"key":"ref5","article-title":"Source code for MSQ-Index","author":"chen","year":"0"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055349"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.10.002"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915236"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.01.074"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0305199101"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1021\/ci7001878"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.129"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl301"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2006.04.012"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89689-0_33"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.2297929"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/9427778\/08907362.pdf?arnumber=8907362","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:53:04Z","timestamp":1641988384000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8907362\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,1]]},"references-count":39,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2019.2954527","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":[[2021,6,1]]}}}