{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,16]],"date-time":"2025-04-16T17:05:52Z","timestamp":1744823152146,"version":"3.37.3"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2017,8,1]],"date-time":"2017-08-01T00:00:00Z","timestamp":1501545600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,8,1]],"date-time":"2017-08-01T00:00:00Z","timestamp":1501545600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,8,1]],"date-time":"2017-08-01T00:00:00Z","timestamp":1501545600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,8,1]],"date-time":"2017-08-01T00:00:00Z","timestamp":1501545600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"US National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1322406"],"award-info":[{"award-number":["IIS-1322406"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Google Research Award"},{"name":"Leir Charitable Foundations"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2017,8,1]]},"DOI":"10.1109\/tkde.2017.2690637","type":"journal-article","created":{"date-parts":[[2017,4,4]],"date-time":"2017-04-04T21:43:57Z","timestamp":1491342237000},"page":"1667-1680","source":"Crossref","is-referenced-by-count":8,"title":["Keyword Search on Temporal Graphs"],"prefix":"10.1109","volume":"29","author":[{"given":"Ziyang","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"505","article-title":"Bidirectional expansion for keyword search on graph databases","author":"kacholia","year":"2005","journal-title":"Proc Int Conf On Very Large Data Bases"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367929"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376708"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871531"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247495"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012722442-8\/50080-X"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367880"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"1642","DOI":"10.14778\/2556549.2556550","article-title":"Probabilistic query rewriting for efficient and effective keyword search on graph data","volume":"6","author":"zhang","year":"2014","journal-title":"Proc VLDB Endowment"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.67"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012088469-8.50051-6"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856320"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-007-0058-x"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335364"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-2289-8_10"},{"year":"0","key":"ref6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2872518.2889293"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/22952.22956"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142377"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247516"},{"year":"0","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2002.994756"},{"year":"0","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-22852-5_20"},{"key":"ref22","article-title":"On graph deltas for historical queries","volume":"abs 1302 5549","author":"koloniari","year":"2013","journal-title":"CoRR"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/AICCSA.2013.6616483"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"726","DOI":"10.14778\/3402707.3402713","article-title":"On querying historical evolving graph sequences","volume":"4","author":"ren","year":"2011","journal-title":"Proc VLDB Endowment"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.4108\/icst.collaboratecom.2012.250532"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353371"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2618243.2618282"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/69\/7970215\/7891889-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7970215\/07891889.pdf?arnumber=7891889","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:49:05Z","timestamp":1649443745000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7891889\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,1]]},"references-count":29,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2017.2690637","relation":{},"ISSN":["1041-4347"],"issn-type":[{"type":"print","value":"1041-4347"}],"subject":[],"published":{"date-parts":[[2017,8,1]]}}}