{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T05:03:56Z","timestamp":1725771836172},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319049380"},{"type":"electronic","value":"9783319049397"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-04939-7_13","type":"book-chapter","created":{"date-parts":[[2014,2,20]],"date-time":"2014-02-20T09:22:51Z","timestamp":1392888171000},"page":"270-289","source":"Crossref","is-referenced-by-count":3,"title":["View-Based Tree-Language Rewritings for XML"],"prefix":"10.1007","author":[{"given":"Laks V. S.","family":"Lakshmanan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Thomo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"115","DOI":"10.3166\/jancl.15.115-135","volume":"15","author":"L. Afanasiev","year":"2005","unstructured":"Afanasiev, L., Blackburn, P., Dimitriou, I., Gaiffe, B., Goris, E., Marx, M., de Rijke, M.: PDL for ordered trees. Journal of Applied Non-Classical Logics\u00a015(2), 115\u2013135 (2005)","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Afrati, F.N., Chirkova, R., Gergatsoulis, M., Kimelfeld, B., Pavlaki, V., Sagiv, Y.: On rewriting XPath queries using views. In: EDBT (2009)","DOI":"10.1145\/1516360.1516381"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/11965893_25","volume-title":"Database Theory \u2013 ICDT 2007","author":"M. Arenas","year":"2006","unstructured":"Arenas, M., Barcel\u00f3, P., Libkin, L.: Combining temporal logics for querying XML documents. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol.\u00a04353, pp. 359\u2013373. Springer, Heidelberg (2006)"},{"key":"13_CR4","unstructured":"Arion, A., Benzaken, V., Manolescu, I., Papakonstantinou, Y.: Structured materialized views for XML queries. In: VLDB (2007)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Balmin, A., \u00d6zcan, F., Beyer, K.S., Cochrane, R., Pirahesh, H.: A framework for using materialized XPath views in XML query processing. In: VLDB (2004)","DOI":"10.1016\/B978-012088469-8.50009-7"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-03793-1_2","volume-title":"Database Programming Languages","author":"D. Calvanese","year":"2009","unstructured":"Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M.Y.: An automata-theoretic approach to regular XPath. In: Gardner, P., Geerts, F. (eds.) DBPL 2009. LNCS, vol.\u00a05708, pp. 18\u201335. Springer, Heidelberg (2009)"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Calvanese, D., Giacomo, G.D., Lenzerini, M., Vardi, M.Y.: Node selection query languages for trees. In: AAAI (2010)","DOI":"10.1609\/aaai.v24i1.7598"},{"key":"13_CR8","unstructured":"Cautis, B., Deutsch, A., Onose, N.: XPath rewriting using multiple views: Achieving completeness and efficiency. In: WebDB (2008)"},{"key":"13_CR9","unstructured":"Claves, P., Jansen, D., Holtrup, S.J., Mohr, M., Reis, A., Schatz, M., Thesing, I.: LETHAL: Library for working with finite tree and hedge automata (2009), http:\/\/lethal.sf.net"},{"key":"13_CR10","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007)"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Fan, W., Geerts, F., Jia, X., Kementsietsidis, A.: Rewriting regular XPath queries on XML views. In: ICDE (2007)","DOI":"10.1109\/ICDE.2007.367912"},{"key":"13_CR12","unstructured":"Filiot, E.: Ranked and unranked tree automata libraries (grappa), http:\/\/www.grappa.univ-lille3.fr\/~filiot\/tata"},{"key":"13_CR13","unstructured":"Filiot, E., Niehren, J., Talbot, J.-M., Tison, S.: Composing monadic queries in trees. In: PLAN-X (2006)"},{"key":"13_CR14","unstructured":"Frick, M., Grohe, M., Koch, C.: Query evaluation on compressed trees (extended abstract). In: LICS (2003)"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Lakshmanan, L.V.S., Thomo, A.: View-based tree-language rewritings for XML (2013), http:\/\/webhome.cs.uvic.ca\/~thomo\/tarewfull.pdf","DOI":"10.1007\/978-3-319-04939-7_13"},{"key":"13_CR16","unstructured":"Lakshmanan, L.V.S., Wang, H., Zhao, Z.J.: Answering tree pattern queries using views. In: VLDB (2006)"},{"issue":"2","key":"13_CR17","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.jal.2009.09.005","volume":"8","author":"L. Libkin","year":"2010","unstructured":"Libkin, L., Sirangelo, C.: Reasoning about XML with temporal logics and automata. J. Applied Logic\u00a08(2), 210\u2013232 (2010)","journal-title":"J. Applied Logic"},{"issue":"1","key":"13_CR18","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/962446.962448","volume":"51","author":"G. Miklau","year":"2004","unstructured":"Miklau, G., Suciu, D.: Containment and equivalence for a fragment of XPath. JACM\u00a051(1), 2\u201345 (2004)","journal-title":"JACM"},{"key":"13_CR19","unstructured":"Neven, F.: Design and Analysis of Query Languages for Structured Documents\u2013A Formal and Logical Approach. PhD thesis. Limburgs Universitair Centrum (1999)"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Neven, F., Schwentick, T.: Expressive and efficient pattern languages for tree-structured data. In: PODS (2000)","DOI":"10.1145\/335168.335217"},{"issue":"1-2","key":"13_CR21","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. TCS\u00a0275(1-2), 633\u2013674 (2002)","journal-title":"TCS"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Neven, F., Schwentick, T.: On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods in Computer Science\u00a02(3) (2006)","DOI":"10.2168\/LMCS-2(3:1)2006"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Niehren, J., Planque, L., Talbot, J.-M., Tison, S.: N-ary queries by tree automata. In: DBPL (2005)","DOI":"10.1007\/11601524_14"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Onose, N., Deutsch, A., Papakonstantinou, Y., Curtmola, E.: Rewriting nested XML queries using nested views. In: SIGMOD Conf. (2006)","DOI":"10.1145\/1142473.1142524"},{"key":"13_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1007\/3-540-44612-5_61","volume-title":"Mathematical Foundations of Computer Science 2000","author":"T. Schwentick","year":"2000","unstructured":"Schwentick, T.: On diving in trees. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 660\u2013669. Springer, Heidelberg (2000)"},{"issue":"3","key":"13_CR26","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.jcss.2006.10.003","volume":"73","author":"T. Schwentick","year":"2007","unstructured":"Schwentick, T.: Automata for XML - a survey. J. Comput. Syst. Sci.\u00a073(3), 289\u2013315 (2007)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"ten Cate, B., Segoufin, L.: XPath, transitive closure logic, and nested tree walking automata. In: PODS (2008)","DOI":"10.1145\/1376916.1376952"},{"issue":"1","key":"13_CR28","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"J.W. Thatcher","year":"1968","unstructured":"Thatcher, J.W., Wright, J.B.: Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory\u00a02(1), 57\u201381 (1968)","journal-title":"Mathematical Systems Theory"},{"key":"13_CR29","unstructured":"Thomo, A., Venkatesh, S.: Rewriting of VPLs for XML data integration. In: CIKM (2008)"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Wang, J., Li, J., Yu, J.X.: Answering tree pattern queries using views: A revisit. In: EDBT (2011)","DOI":"10.1145\/1951365.1951386"},{"key":"13_CR31","unstructured":"Xu, W., \u00d6zsoyoglu, Z.M.: Rewriting XPath queries using materialized views. In: VLDB (2005)"},{"key":"13_CR32","doi-asserted-by":"crossref","unstructured":"Yu, C., Popa, L.: Constraint-based XML query rewriting for data integration. In: SIGMOD (2004)","DOI":"10.1145\/1007568.1007611"}],"container-title":["Lecture Notes in Computer Science","Foundations of Information and Knowledge Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-04939-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T16:13:50Z","timestamp":1689005630000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-04939-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319049380","9783319049397"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04939-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}