{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:17:49Z","timestamp":1740169069630,"version":"3.37.3"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472169","61502215"],"award-info":[{"award-number":["61472169","61502215"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science Research Normal Fund of Liaoning Province Education Department","award":["L2015193"],"award-info":[{"award-number":["L2015193"]}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"crossref","award":["2016YFC0801406"],"award-info":[{"award-number":["2016YFC0801406"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2885038","type":"journal-article","created":{"date-parts":[[2018,12,12]],"date-time":"2018-12-12T20:22:08Z","timestamp":1544646128000},"page":"78471-78482","source":"Crossref","is-referenced-by-count":2,"title":["Top-$k$  Subgraph Query Based on Frequent Structure in Large-Scale Dynamic Graphs"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1356-1304","authenticated-orcid":false,"given":"Xiaohuan","family":"Shan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangxiang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4524-1647","authenticated-orcid":false,"given":"Linlin","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baoyan","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Stanford Large Network Dataset Collection","year":"2014","key":"ref38"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/BIGCOMP.2017.7881695"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498307"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915216"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816703"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxv118"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.14778\/2536258.2536263"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915216"},{"key":"ref34","first-page":"25","article-title":"Subgraph querying with parallel use of query rewritings and alternative algorithms","volume":"1","author":"katsarou","year":"2017","journal-title":"Proc EDBT"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"617","DOI":"10.14778\/2735479.2735493","article-title":"Exploiting vertex relationships in speeding up subgraph isomorphism over large graphs","volume":"8","author":"xuguang","year":"2015","journal-title":"J Proc VLDB Endowment"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098040"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0968-2"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.14778\/3149193.3149198"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2015.12.142"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2015.11.132"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/BigMM.2017.80"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42553-5_21"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2015.7364122"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s11390-017-1708-0","article-title":"Approximate continuous top-k query over sliding window","volume":"32","author":"rui","year":"2017","journal-title":"J Comput Sci Technol"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9291-6"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.05.066"},{"key":"ref27","first-page":"990","article-title":"Fast top-k search in knowledge graphs","author":"shengqi","year":"2016","journal-title":"Proc IEEE ICDE"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2015.2488593"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MCG.2016.40"},{"key":"ref29","first-page":"114","article-title":"A dual branches feature based subgragh query algorithm","volume":"48","author":"yinan","year":"2011","journal-title":"J Comput Res Develop"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007607"},{"key":"ref8","first-page":"52","article-title":"An algorithm for subgraph matching based on adaptive structural summary of labeled directed graph data","volume":"40","author":"haiwei","year":"2017","journal-title":"Chin J Comput"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2509973"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-017-1525-z"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/BIGCOMP.2017.7881695"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2016.11.018"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3041021.3054191"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2399292"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021929"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1391729.1391730"},{"article-title":"BB-graph: A new subgraph isomorphism algorithm for efficiently querying big graph databases","year":"2016","author":"asiler","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44406-2_23"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367935"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08573576.pdf?arnumber=8573576","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T04:04:51Z","timestamp":1643256291000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8573576\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2885038","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}