Abstract
A query is determined by a view, if the result to the query can be reconstructed from the result of the view. We consider the problem of deciding for two given tree transformations, whether one is determined by the other. If the view transformation is induced by a tree transducer that may copy, then determinacy is undecidable, even for identity queries. For a large class of non-copying views, namely compositions of functional extended linear top-down tree transducers with regular look-ahead, we show that determinacy is decidable, where queries are given by deterministic top-down tree transducers with regular look-ahead or by MSO tree transducers. We also show that if a query is determined, then it can be rewritten into a query that works directly over the view and is in the same class as the given query. The proof relies on the decidability of equivalence for the two considered classes of queries, and on their closure under composition.
Benedikt and Maneth were supported by the Engineering and Physical Sciences Research Council project “Enforcement of Constraints on XML streams” (EPSRC EP/G004021/1).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Afrati, F.N.: Determinacy and query rewriting for conjunctive queries and views. Theor. Comput. Sci. 412(11), 1005–1021 (2011)
Alur, R., D’Antoni, L.: Streaming tree transducers. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol. 7392, pp. 42–53. Springer, Heidelberg (2012)
Arnold, A., Dauchet, M.: Bi-transductions de forêts. In: ICALP (1976)
Bloem, R., Engelfriet, J.: A comparison of tree transductions defined by monadic second order logic and by attribute grammars. J. Comput. Syst. Sci. 61(1), 1–50 (2000)
Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic, a Language-Theoretic Approach. Cambridge University Press (2012)
Engelfriet, J.: Bottom-up and top-down tree transformations - a comparison. Math. Systems Theory 9(3), 198–231 (1975)
Engelfriet, J.: Top-down tree transducers with regular look-ahead. Math. Systems Theory 10, 289–303 (1977)
Engelfriet, J.: On tree transducers for partial functions. Inf. Proc. Lett. 7(4), 170–172 (1978)
Engelfriet, J., Lilin, E., Maletti, A.: Extended multi bottom-up tree transducers. Acta Inf. 46(8), 561–590 (2009)
Engelfriet, J., Maneth, S.: Macro tree transducers, attribute grammars, and MSO definable tree translations. Inf. Comput. 154(1), 34–91 (1999)
Engelfriet, J., Maneth, S.: Macro tree translations of linear size increase are MSO definable. SIAM J. Comput. 32(4), 950–1006 (2003)
Engelfriet, J., Maneth, S.: The equivalence problem for deterministic MSO tree transducers is decidable. Inf. Proc. Lett. 100(5), 206–212 (2006)
Engelfriet, J., Maneth, S., Seidl, H.: Deciding equivalence of top-down XML transformations in polynomial time. J. Comput. Syst. Sci. 75(5), 271–286 (2009)
Engelfriet, J., Rozenberg, G., Slutzki, G.: Tree transducers, L systems, and two-way machines. J. Comput. Syst. Sci. 20(2), 150–202 (1980)
Ésik, Z.: On decidability of injectivity of tree transformations. In: Les Arbres en Algèbre et en Programmation, Lille, pp. 107–133 (1978)
Ésik, Z.: Decidability results concerning tree transducers I. Acta Cybern. 5, 1–20 (1981)
Fülöp, Z., Gyenizse, P.: On injectivity of deterministic top-down tree transducers. Inf. Proc. Lett. 48(4), 183–188 (1993)
Fülöp, Z., Maletti, A.: Composition closure of ε-free linear extended top-down tree transducers. In: Béal, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 239–251. Springer, Heidelberg (2013)
Fülöp, Z., Maletti, A., Vogler, H.: Weighted extended tree transducers. Fundam. Inform. 111(2), 163–202 (2011)
Groz, B.: XML Security Views: Queries, Updates, and Schemas. PhD thesis, Université Lille 1 (2012)
Groz, B., Staworko, S., Caron, A.-C., Roos, Y., Tison, S.: Static analysis of XML security views and query rewriting. Inf. Comput. (to appear, 2013)
Gurari, E.M., Ibarra, O.H.: A note on finite-valued and finitely ambiguous transducers. Math. Systems Theory 16(1), 61–66 (1983)
Hashimoto, K., Sawada, R., Ishihara, Y., Seki, H., Fujiwara, T.: Determinacy and subsumption for single-valued bottom-up tree transducers. In: Dediu, A.-H., Martín-Vide, C., Truthe, B. (eds.) LATA 2013. LNCS, vol. 7810, pp. 335–346. Springer, Heidelberg (2013)
Maletti, A.: Compositions of extended top-down tree transducers. Inf. Comput. 206(9-10), 1187–1196 (2008)
Maletti, A., Graehl, J., Hopkins, M., Knight, K.: The power of extended top-down tree transducers. SIAM J. Comput. 39(2), 410–430 (2009)
Nash, A., Segoufin, L., Vianu, V.: Views and queries: Determinacy and rewriting. ACM Trans. Database Syst. 35(3) (2010)
Pasailă, D.: Conjunctive queries determinacy and rewriting. In: ICDT (2011)
Perst, T., Seidl, H.: Macro forest transducers. Inf. Proc. Lett. 89(3), 141–149 (2004)
Segoufin, L., Vianu, V.: Views and queries: determinacy and rewriting. In: PODS (2005)
Seidl, H.: Single-valuedness of tree transducers is decidable in polynomial time. Theor. Comput. Sci. 106(1), 135–181 (1992)
Seidl, H.: Equivalence of finite-valued tree transducers is decidable. Math. Systems Theory 27(4), 285–346 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benedikt, M., Engelfriet, J., Maneth, S. (2013). Determinacy and Rewriting of Top-Down and MSO Tree Transformations. In: Chatterjee, K., Sgall, J. (eds) Mathematical Foundations of Computer Science 2013. MFCS 2013. Lecture Notes in Computer Science, vol 8087. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40313-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-40313-2_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40312-5
Online ISBN: 978-3-642-40313-2
eBook Packages: Computer ScienceComputer Science (R0)