{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:47:19Z","timestamp":1725472039477},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540482819"},{"type":"electronic","value":"9783540482826"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11916277_32","type":"book-chapter","created":{"date-parts":[[2006,10,17]],"date-time":"2006-10-17T14:32:59Z","timestamp":1161095579000},"page":"467-481","source":"Crossref","is-referenced-by-count":1,"title":["Automata for Positive Core XPath Queries on Compressed Documents"],"prefix":"10.1007","author":[{"given":"Barbara","family":"Fila","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siva","family":"Anantharaman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Buneman, P., Grohe, M., Koch, C.: Path queries on compressed XML. In: Ed. Morgan Kaufmann Proc. of the 29th Conf. on VLDB, pp. 141\u2013152 (2003)","DOI":"10.1016\/B978-012722442-8\/50021-5"},{"key":"32_CR2","unstructured":"Busatto, G., Lohrey, M., Maneth, S.: Grammar-Based Tree Compression. EPFL Technical Report IC\/2004\/80, \n                  \n                    http:\/\/icwww.epfl.ch\/publications"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/11601524_13","volume-title":"Database Programming Languages","author":"G. Busatto","year":"2005","unstructured":"Busatto, G., Lohrey, M., Maneth, S.: Efficient Memory Representation of XML Documents. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol.\u00a03774, pp. 199\u2013216. Springer, Heidelberg (2005)"},{"key":"32_CR4","unstructured":"Fila, B., Anantharaman, S.: Automata for Analyzing and Querying Compressed Documents, Research Report, RR-2006-03, LIFO (2006), \n                  \n                    http:\/\/www.univ-orleans.fr\/lifo\/prodsci\/rapports\/RR\/RR2006\/"},{"key":"32_CR5","first-page":"188","volume-title":"Proc. of LICS 2003","author":"M. Frick","year":"2003","unstructured":"Frick, M., Grohe, M., Koch, C.: Query Evaluation of Compressed Trees. In: Proc. of LICS 2003, pp. 188\u2013197. IEEE, Los Alamitos (2003)"},{"key":"32_CR6","first-page":"189","volume-title":"Proc. of LICS 2002","author":"G. Gottlob","year":"2002","unstructured":"Gottlob, G., Koch, C.: Monadic Queries over Tree-Structured Data. In: Proc. of LICS 2002, pp. 189\u2013202. IEEE, Los Alamitos (2002)"},{"issue":"2","key":"32_CR7","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1145\/1059513.1059520","volume":"52","author":"G. Gottlob","year":"2005","unstructured":"Gottlob, G., Koch, C., Pichler, R., Segoufin, L.: The complexity of XPath query evaluation and XML typing. Journal of the ACM\u00a052(2), 284\u2013335 (2005)","journal-title":"Journal of the ACM"},{"issue":"5","key":"32_CR8","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1137\/S0097539704445950","volume":"35","author":"M. Lohrey","year":"2006","unstructured":"Lohrey, M.: Word problems and membership problems on compressed words. SIAM Journal of Computing\u00a035(5), 1210\u20131240 (2006)","journal-title":"SIAM Journal of Computing"},{"key":"32_CR9","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-45206-5_13","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"M. Marx","year":"2003","unstructured":"Marx, M.: XPath and Modal Logics for Finite DAGs. In: Cialdea Mayer, M., Pirri, F. (eds.) TABLEAUX 2003. LNCS (LNAI), vol.\u00a02796, pp. 150\u2013164. Springer, Heidelberg (2003)"},{"issue":"1","key":"32_CR10","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.tcs.2004.10.035","volume":"336","author":"W. Martens","year":"2005","unstructured":"Martens, W., Neven, F.: On the complexity of typechecking top-down XML transformations. Theoretical Computer Science\u00a0336(1), 153\u2013180 (2005)","journal-title":"Theoretical Computer Science"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Neven, F.: Automata Theory for XML Researchers. SIGMOD Record\u00a031(3) (September 2002)","DOI":"10.1145\/601858.601869"},{"issue":"1\u20132","key":"32_CR12","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/S0304-3975(01)00301-2","volume":"275","author":"F. Neven","year":"2002","unstructured":"Neven, F., Schwentick, T.: Query automata over finite trees. Theoretical Computer Science\u00a0275(1\u20132), 633\u2013674 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"11","key":"32_CR13","doi-asserted-by":"publisher","first-page":"1769","DOI":"10.1109\/5.892712","volume":"88","author":"W. Rytter","year":"2000","unstructured":"Rytter, W.: Compressed and fully compressed pattern matching in one and two dimensions. Proceedings of the IEEE\u00a088(11), 1769\u20131778 (2000)","journal-title":"Proceedings of the IEEE"},{"key":"32_CR14","unstructured":"World Wide Web Consortium, XML Path Language (XPath Recommendation), \n                  \n                    http:\/\/www.w3c.org\/TR\/xpath\/"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11916277_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:42:24Z","timestamp":1619494944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11916277_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540482819","9783540482826"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11916277_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}