{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:46Z","timestamp":1760202706008,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1109\/icde.2016.7498310","type":"proceedings-article","created":{"date-parts":[[2016,6,25]],"date-time":"2016-06-25T11:36:34Z","timestamp":1466854594000},"page":"1026-1037","source":"Crossref","is-referenced-by-count":2,"title":["Incremental updates on compressed XML"],"prefix":"10.1109","author":[{"given":"Stefan","family":"Bottcher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rita","family":"Hartel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Jacobs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Maneth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"445","article-title":"Approximation of smallest linear tree grammar","author":"jez","year":"2014","journal-title":"STACS"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850116"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799364092"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353354"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30850-5_20"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2601073"},{"journal-title":"XMLCompBench Benchmark of XML Compression Tools","year":"0","author":"sakr","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.07.024"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/1970398.1970402","article-title":"Unification and matching on compressed terms","volume":"12","author":"gasc\u00f3n","year":"2011","journal-title":"ACM Trans Comput Log"},{"journal-title":"Fast and tiny structural self-indexes for XML","year":"2010","author":"maneth","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.06.006"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367908"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.1999.755679"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39467-6_15"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24577-0_17"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2008.01.004"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012722442-8\/50021-5"},{"key":"ref9","first-page":"533","article-title":"Faster Fully Compressed Pattern Matching by Recompression","author":"jez","year":"2012","journal-title":"ICALP"}],"event":{"name":"2016 IEEE 32nd International Conference on Data Engineering (ICDE)","start":{"date-parts":[[2016,5,16]]},"location":"Helsinki, Finland","end":{"date-parts":[[2016,5,20]]}},"container-title":["2016 IEEE 32nd International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7491900\/7498210\/07498310.pdf?arnumber=7498310","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:06:25Z","timestamp":1498323985000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7498310\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/icde.2016.7498310","relation":{},"subject":[],"published":{"date-parts":[[2016,5]]}}}