{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:04:07Z","timestamp":1725591847165},"reference-count":11,"publisher":"IEEE","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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1109\/ccoms.2019.8821730","type":"proceedings-article","created":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T01:45:06Z","timestamp":1567475106000},"page":"257-262","source":"Crossref","is-referenced-by-count":0,"title":["Graph Compression by Tree Grammars and Direct Evaluation of Regular Path Query"],"prefix":"10.1109","author":[{"given":"Takeshi","family":"Takeda","sequence":"first","affiliation":[]},{"given":"Kenji","family":"Hashimoto","sequence":"additional","affiliation":[]},{"given":"Hiroyuki","family":"Seki","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2018.00039"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498233"},{"journal-title":"Konect","year":"0","key":"ref10"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/38713.38749"},{"journal-title":"Stanford Large Network Dataset Collection","year":"0","key":"ref11"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/298514.298591"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.06.006"},{"journal-title":"Tree Automata Techniques and Applications","year":"2008","author":"comon","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0648-4"},{"journal-title":"DBPedia","year":"0","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2015.10.004"}],"event":{"name":"2019 IEEE 4th International Conference on Computer and Communication Systems (ICCCS)","start":{"date-parts":[[2019,2,23]]},"location":"Singapore","end":{"date-parts":[[2019,2,25]]}},"container-title":["2019 IEEE 4th International Conference on Computer and Communication Systems (ICCCS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8811523\/8821628\/08821730.pdf?arnumber=8821730","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T03:13:41Z","timestamp":1657854821000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8821730\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/ccoms.2019.8821730","relation":{},"subject":[],"published":{"date-parts":[[2019,2]]}}}