{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:16:17Z","timestamp":1740132977245,"version":"3.37.3"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"ARC","award":["DE140100999","DP160101513"],"award-info":[{"award-number":["DE140100999","DP160101513"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672235"],"award-info":[{"award-number":["61672235"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ARC","award":["DP170101628","DP180103096","DE150100563","DP160101513"],"award-info":[{"award-number":["DP170101628","DP180103096","DE150100563","DP160101513"]}]},{"name":"Research Grants Council of the Hong Kong SAR","award":["14221716","12258116"],"award-info":[{"award-number":["14221716","12258116"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2019,2,1]]},"DOI":"10.1109\/tkde.2018.2833124","type":"journal-article","created":{"date-parts":[[2018,5,4]],"date-time":"2018-05-04T19:11:41Z","timestamp":1525461101000},"page":"385-400","source":"Crossref","is-referenced-by-count":6,"title":["Supergraph Search in Graph Databases via Hierarchical Feature-Tree"],"prefix":"10.1109","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6795-9262","authenticated-orcid":false,"given":"Bingqing","family":"Lyu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6068-5062","authenticated-orcid":false,"given":"Lu","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6830-3900","authenticated-orcid":false,"given":"Lijun","family":"Chang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9738-827X","authenticated-orcid":false,"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","first-page":"329","article-title":"Inexact matching of large and sparse graphs using laplacian eigenvectors","author":"knossow","year":"2009","journal-title":"Proc Int Workshop Graph-Based Representations Pattern Recognit"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1142\/S0218001404003186","article-title":"Inexact graph matching using eigen-subspace projection clustering","volume":"18","author":"terry","year":"2004","journal-title":"Int J Pattern Recognit Artifi Intell"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1265866"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1109\/3477.956043","article-title":"A PCA approach for fast retrieval of structural patterns in attributed graphs","volume":"31","author":"xu","year":"2001","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.245"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp196"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s00778-010-0212-8","article-title":"Fast graph query processing with a low-cost index","volume":"20","author":"cheng","year":"2011","journal-title":"VLDB J"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13818-8_26"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1021\/ci0496402"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl571"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497505"},{"journal-title":"Data Management of Protein Interaction Networks","year":"2011","author":"chen","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/83.841950"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1990","author":"garey","key":"ref17"},{"key":"ref18","first-page":"721","article-title":"gSpan: Graph-based substructure pattern mining","author":"yan","year":"2002","journal-title":"Proc IEEE Int Conf Data Mining"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498237"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1162\/089976603321780317"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367902"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71681-5_2"},{"key":"ref3","first-page":"938","article-title":"Graph indexing: Tree + delta >= graph","author":"zhao","year":"2007","journal-title":"Proc Int Conf Very Large Data Bases"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.11"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/34.6778"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453899"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.14778\/2536206.2536211"},{"key":"ref7","first-page":"926","article-title":"Towards graph containment search and indexing","author":"chen","year":"2007","journal-title":"Proc Int Conf On Very Large Data Bases"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247574"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516385"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007607"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.368955"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"ref24","first-page":"337","article-title":"Turbo iso: Towards ultrafast and robust subgraph isomorphism search in large graph databases","author":"han","year":"2013","journal-title":"Proc ACM SIGMOD Int Conf Manage Data"},{"key":"ref23","first-page":"125","article-title":"Query language and access methods for graph databases","author":"he","year":"2010","journal-title":"Managing and Mining Graph Data"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2002.994702"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144502415960"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8606809\/08354892.pdf?arnumber=8354892","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:14:12Z","timestamp":1657746852000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8354892\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,1]]},"references-count":35,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2018.2833124","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"type":"print","value":"1041-4347"},{"type":"electronic","value":"1558-2191"},{"type":"electronic","value":"2326-3865"}],"subject":[],"published":{"date-parts":[[2019,2,1]]}}}