{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:58Z","timestamp":1750307038028,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,3,18]],"date-time":"2013-03-18T00:00:00Z","timestamp":1363564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EPSRC EP\/G004021\/1"],"award-info":[{"award-number":["EPSRC EP\/G004021\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["LO 748\/8, INST 268\/239"],"award-info":[{"award-number":["LO 748\/8, INST 268\/239"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,3,18]]},"DOI":"10.1145\/2448496.2448506","type":"proceedings-article","created":{"date-parts":[[2013,3,19]],"date-time":"2013-03-19T13:34:53Z","timestamp":1363700093000},"page":"69-80","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["XML compression via DAGs"],"prefix":"10.1145","author":[{"given":"Markus","family":"Lohrey","sequence":"first","affiliation":[{"name":"Universit\u00e4t Leipzig"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Maneth","sequence":"additional","affiliation":[{"name":"University of Oxford"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Noeth","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Leipzig"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,3,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1239971.1239974"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350242"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133066"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1315451.1315465"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2008.01.004"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322228"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/368892.368907"},{"key":"e_1_3_2_1_8_1","first-page":"188","volume-title":"LICS","author":"Frick M.","year":"2003","unstructured":"M. Frick , M. Grohe , and C. Koch . Query evaluation on compressed trees (extended abstract) . In LICS , pages 188 -- 197 , 2003 . M. Frick, M. Grohe, and C. Koch. Query evaluation on compressed trees (extended abstract). In LICS, pages 188--197, 2003."},{"key":"e_1_3_2_1_9_1","volume-title":"Fundamental Algorithms","author":"Knuth D. E.","year":"1968","unstructured":"D. E. Knuth . The Art of Computer Programming , Vol. I : Fundamental Algorithms . Addison-Wesley , 1968 . D. E. Knuth. The Art of Computer Programming, Vol. I: Fundamental Algorithms. Addison-Wesley, 1968."},{"key":"e_1_3_2_1_10_1","first-page":"249","volume-title":"VLDB","author":"Koch C.","year":"2003","unstructured":"C. Koch . Efficient processing of expressive node-selecting queries on XML data in secondary storage: A tree automata-based approach . In VLDB , pages 249 -- 260 , 2003 . C. Koch. Efficient processing of expressive node-selecting queries on XML data in secondary storage: A tree automata-based approach. In VLDB, pages 249--260, 2003."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/789086.789701"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335405"},{"key":"e_1_3_2_1_13_1","first-page":"241","article-title":"Algorithmics on SLP-compressed strings: a survey","volume":"4","author":"Lohrey M.","year":"2013","unstructured":"M. Lohrey . Algorithmics on SLP-compressed strings: a survey . Groups Complexity Cryptology , 4 : 241 -- 299 , 2013 . M. Lohrey. Algorithmics on SLP-compressed strings: a survey. Groups Complexity Cryptology, 4:241--299, 2013.","journal-title":"Groups Complexity Cryptology"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.07.024"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2011.42"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2012.03.003"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24727-2_26"},{"key":"e_1_3_2_1_18_1","volume-title":"Fast and tiny structural self-indexes for XML. CoRR, abs\/1012.5696","author":"Maneth S.","year":"2010","unstructured":"S. Maneth and T. Sebastian . Fast and tiny structural self-indexes for XML. CoRR, abs\/1012.5696 , 2010 . S. Maneth and T. Sebastian. Fast and tiny structural self-indexes for XML. CoRR, abs\/1012.5696, 2010."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/552553"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/601858.601869"},{"key":"e_1_3_2_1_21_1","volume-title":"Identifying hierarchical strcture in sequences: A linear-time algorithm. J. Artif. Intell. Res. (JAIR), 7:67--82","author":"Nevill-Manning C. G.","year":"1997","unstructured":"C. G. Nevill-Manning and I. H. Witten . Identifying hierarchical strcture in sequences: A linear-time algorithm. J. Artif. Intell. Res. (JAIR), 7:67--82 , 1997 . C. G. Nevill-Manning and I. H. Witten. Identifying hierarchical strcture in sequences: A linear-time algorithm. J. Artif. Intell. Res. (JAIR), 7:67--82, 1997."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/647904.739319"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.10.003"},{"key":"e_1_3_2_1_24_1","first-page":"1","volume-title":"DBPL","author":"Suciu D.","year":"2001","unstructured":"D. Suciu . Typechecking for semistructured data . In DBPL , pages 1 -- 20 , 2001 . D. Suciu. Typechecking for semistructured data. In DBPL, pages 1--20, 2001."}],"event":{"name":"EDBT\/ICDT '13: Joint 2013 EDBT\/ICDT Conferences","acronym":"EDBT\/ICDT '13","location":"Genoa Italy"},"container-title":["Proceedings of the 16th International Conference on Database Theory"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2448496.2448506","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2448496.2448506","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:51Z","timestamp":1750238451000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2448496.2448506"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,18]]},"references-count":24,"alternative-id":["10.1145\/2448496.2448506","10.1145\/2448496"],"URL":"https:\/\/doi.org\/10.1145\/2448496.2448506","relation":{},"subject":[],"published":{"date-parts":[[2013,3,18]]},"assertion":[{"value":"2013-03-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}