{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T06:28:53Z","timestamp":1759991333825,"version":"3.37.3"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"General Research Fund of Hong Kong","award":["GRF210510"],"award-info":[{"award-number":["GRF210510"]}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71171122"],"award-info":[{"award-number":["71171122"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001747","name":"Department of Computer Science at Hong Kong Baptist University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001747","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2015,7,1]]},"DOI":"10.1109\/tkde.2014.2316818","type":"journal-article","created":{"date-parts":[[2014,4,11]],"date-time":"2014-04-11T18:07:45Z","timestamp":1397239665000},"page":"1838-1860","source":"Crossref","is-referenced-by-count":19,"title":["Authenticated Subgraph Similarity Searchin Outsourced Graph Databases"],"prefix":"10.1109","volume":"27","author":[{"given":"Yun","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhe","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Byron","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianliang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sourav S","family":"Bhowmick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021271615909"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87477-5_39"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40627-0_59"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367902"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-003-1076-8"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453876"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1002\/wcms.5"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007607"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989418"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497505"},{"key":"ref28","first-page":"295","article-title":"Authenticated data structures for graph and geometric searching","volume":"2612","author":"goodrich","year":"0","journal-title":"Proc RSA Conf Cryptographers’ Track"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447914"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739114"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807264"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066244"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/AICCSA.2007.370907"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497517"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066204"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559849"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"101","DOI":"10.3233\/JCS-2009-0315","article-title":"Query assurance verification for outsourced multi-dimensional databases","volume":"17","author":"cheng","year":"2009","journal-title":"J Comput Secur"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453875"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142488"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920901"},{"year":"0","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btr130"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4789-6_12"},{"year":"0","key":"ref12"},{"year":"0","key":"ref13"},{"year":"0","key":"ref14"},{"year":"0","key":"ref15"},{"key":"ref16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01887-9","author":"pang","year":"2012","journal-title":"Query Answer Authentication"},{"key":"ref17","first-page":"426","article-title":"M-tree: An efficient access method for similarity search in metric spaces","author":"ciaccia","year":"0","journal-title":"Proc 23rd Int Conf Very Large Data Bases"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90074-R"},{"key":"ref19","first-page":"311","article-title":"Data structures and algorithms for nearest neighbor search in general metric spaces","author":"yianilos","year":"0","journal-title":"Proc 9th Annual ACM-SIAM Symp on Discrete Algorithms"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311908"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247650"},{"key":"ref6","first-page":"38","article-title":"Closure-tree: An index structure for graph queries","author":"he","year":"0","journal-title":"Proc 2nd Int Conf Data Eng"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.368956"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1093\/bioinformatics\/btl571","article-title":"Saga: A subgraph matching tool for biological graphs","volume":"23","author":"yuanyuan","year":"2007","journal-title":"Bioinformatics"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247666"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247574"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1142\/S021972001000477X"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1002\/spe.588"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-008-0108-z"},{"year":"0","key":"ref48"},{"year":"0","key":"ref47"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312264"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00179-7"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/958942.958948"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34805-0_21"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7116676\/06786998.pdf?arnumber=6786998","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T01:54:48Z","timestamp":1689126888000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6786998\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,1]]},"references-count":50,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2014.2316818","relation":{},"ISSN":["1041-4347"],"issn-type":[{"type":"print","value":"1041-4347"}],"subject":[],"published":{"date-parts":[[2015,7,1]]}}}