{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:56:27Z","timestamp":1742925387971,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319905297"},{"type":"electronic","value":"9783319905303"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-90530-3_11","type":"book-chapter","created":{"date-parts":[[2018,4,24]],"date-time":"2018-04-24T07:23:53Z","timestamp":1524554633000},"page":"118-131","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Grammar-Based Compression of Unranked Trees"],"prefix":"10.1007","author":[{"given":"Adri\u00e0","family":"Gasc\u00f3n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Lohrey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Maneth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carl Philipp","family":"Reh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt","family":"Sieber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,25]]},"reference":[{"issue":"4","key":"11_CR1","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/s00224-015-9617-5","volume":"57","author":"S Abiteboul","year":"2015","unstructured":"Abiteboul, S., Bourhis, P., Vianu, V.: Highly expressive query languages for unordered data trees. Theor. Comput. Syst. 57(4), 927\u2013966 (2015)","journal-title":"Theor. Comput. Syst."},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.ic.2014.12.012","volume":"243","author":"P Bille","year":"2015","unstructured":"Bille, P., G\u00f8rtz, I.L., Landau, G.M., Weimann, O.: Tree compression with top trees. Inf. Comput. 243, 166\u2013177 (2015)","journal-title":"Inf. Comput."},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-319-15579-1_13","volume-title":"Language and Automata Theory and Applications","author":"A Boiret","year":"2015","unstructured":"Boiret, A., Hugot, V., Niehren, J., Treinen, R.: Logics for unordered trees with data constraints on siblings. In: Dediu, A.-H., Formenti, E., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 175\u2013187. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15579-1_13"},{"key":"11_CR4","unstructured":"Boja\u0144czyk, M., Walukiewicz, I.: Forest algebras. In: Proceedings of Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas], Texts in Logic and Games, vol. 2, pp. 107\u2013132. Amsterdam University Press (2008)"},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s00224-014-9593-1","volume":"57","author":"I Boneva","year":"2015","unstructured":"Boneva, I., Ciucanu, R., Staworko, S.: Schemas for unordered XML on a DIME. Theory Comput. Syst. 57(2), 337\u2013376 (2015)","journal-title":"Theory Comput. Syst."},{"issue":"4\u20135","key":"11_CR6","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.is.2008.01.004","volume":"33","author":"G Busatto","year":"2008","unstructured":"Busatto, G., Lohrey, M., Maneth, S.: Efficient memory representation of XML document trees. Inf. Syst. 33(4\u20135), 456\u2013474 (2008)","journal-title":"Inf. Syst."},{"key":"11_CR7","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., L\u00f6ding, C., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications. http:\/\/www.grappa.univ-lille3.fr\/tata (2007)"},{"key":"11_CR8","unstructured":"Creus, C., Gasc\u00f3n, A., Godoy, G.: One-context unification with STG-compressed terms is in NP. In: Proceedings of RTA 2012, LIPIcs 15, pp. 149\u2013164. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2012)"},{"key":"11_CR9","unstructured":"Dudek, B., Gawrychowski, P.: Slowing down top trees for better worst-case bounds (2018). https:\/\/arxiv.org\/abs\/1801.01059"},{"issue":"4","key":"11_CR10","doi-asserted-by":"publisher","first-page":"26:1","DOI":"10.1145\/1970398.1970402","volume":"12","author":"A Gasc\u00f3n","year":"2011","unstructured":"Gasc\u00f3n, A., Godoy, G., Schmidt-Schau\u00df, M.: Unification and matching on compressed terms. ACM Trans. Comput. Logic 12(4), 26:1\u201326:37 (2011)","journal-title":"ACM Trans. Comput. Logic"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-319-90530-3_11","volume-title":"Computer Science \u2013 Theory and Applications","author":"Adri\u00e0 Gasc\u00f3n","year":"2018","unstructured":"Gasc\u00f3n, A., Lohrey, M., Maneth, S., Reh, P., Sieber, K.: Grammar-based compression of unranked trees (2018). https:\/\/arxiv.org\/abs\/1802.05490"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-319-20086-6_2","volume-title":"Experimental Algorithms","author":"L H\u00fcbschle-Schneider","year":"2015","unstructured":"H\u00fcbschle-Schneider, L., Raman, R.: Tree compression with top trees revisited. In: Bampis, E. (ed.) SEA 2015. LNCS, vol. 9125, pp. 15\u201327. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20086-6_2"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-662-43951-7_21","volume-title":"Automata, Languages, and Programming","author":"A Je\u017c","year":"2014","unstructured":"Je\u017c, A.: Context unification is in PSPACE. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 244\u2013255. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43951-7_21"},{"issue":"2","key":"11_CR14","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1515\/gcc-2012-0016","volume":"4","author":"M Lohrey","year":"2012","unstructured":"Lohrey, M.: Algorithmics on SLP-compressed strings: a survey. Groups Complex. Cryptol. 4(2), 241\u2013299 (2012)","journal-title":"Groups Complex. Cryptol."},{"issue":"8","key":"11_CR15","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.is.2013.06.006","volume":"38","author":"M Lohrey","year":"2013","unstructured":"Lohrey, M., Maneth, S., Mennicke, R.: XML tree structure compression using RePair. Inf. Syst. 38(8), 1150\u20131167 (2013)","journal-title":"Inf. Syst."},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-662-47666-6_27","volume-title":"Automata, Languages, and Programming","author":"M Lohrey","year":"2015","unstructured":"Lohrey, M., Maneth, S., Peternek, F.: Compressed tree canonization. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 337\u2013349. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47666-6_27"},{"key":"11_CR17","unstructured":"Lohrey, M., Maneth, S., Reh, C.P.: Compression of unordered XML trees. In: Proceedings of ICDT 2017, LIPIcs 68, pp. 18:1\u201318:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"issue":"5","key":"11_CR18","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1016\/j.jcss.2012.03.003","volume":"78","author":"M Lohrey","year":"2012","unstructured":"Lohrey, M., Maneth, S., Schmidt-Schau\u00df, M.: Parameter reduction and automata evaluation for grammar-compressed trees. J. Comput. Syst. Sci. 78(5), 1651\u20131669 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR19","unstructured":"Lohrey, M., Reh, P., Sieber, K.: Optimal top dag construction (2017). https:\/\/arxiv.org\/abs\/1712.05822"},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.datak.2011.11.003","volume":"72","author":"S Sundaram","year":"2012","unstructured":"Sundaram, S., Madria, S.K.: A change detection system for unordered XML data using a relational model. Data Knowl. Eng. 72, 257\u2013284 (2012)","journal-title":"Data Knowl. Eng."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-90530-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:29:54Z","timestamp":1710242994000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-90530-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319905297","9783319905303"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-90530-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"25 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}