Games for Active XML Revisited
- 146 Downloads
The article studies the rewriting mechanisms for intensional documents in the Active XML framework, abstracted in the form of active context-free games. The safe rewriting problem studied in this article is to decide whether the first player, JULIET, has a winning strategy for a given game and (nested) word; this corresponds to a successful rewriting strategy for a given intensional document. The article examines several extensions of active context-free games. The primary extension allows for more expressive schemas (namely XML schemas and regular nested word languages) for both target and replacement languages and has the effect that games are played on nested words instead of (flat) words as in previous studies. Other extensions consider validation of input parameters of web services, and an alternative semantics based on insertion of values returned by the services. In general, the complexity of the safe rewriting problem is highly intractable (doubly exponential time), but the article identifies relevant tractable cases.
KeywordsActive XML Computational complexity Nested words Rewriting games Semistructured data
We would like to thank the anonymous reviewers of ICDT 2015 and ToCS for their insightful and constructive comments. We are grateful to Nils Vortmeier and Thomas Zeume for careful proof reading, and to Krystian Kensy for checking our proof of Proposition 5.2 (b) and for pinpointing the problems in the algorithm of  as part of his Master’s thesis.
- 2.Abiteboul, S., Milo, T., Benjelloun, O.: Regular rewriting of active XML and unambiguity (2005)Google Scholar
- 3.Rajeev, A., Madhusudan, P.: Adding nesting structure to words. J. ACM 56(3) (2009)Google Scholar
- 4.Björklund, H., Schuster, M., Schwentick, T., Kulbatzki, J.: On optimum left-to-right strategies for active context-free games. In: Joint 2013 EDBT/ICDT Conferences, ICDT ’13 Proceedings, Genoa, Italy, March 18-22, 2013, pp. 105–116 (2013)Google Scholar
- 5.Bozzelli, L.: Alternating automata and a temporal fixpoint calculus for visibly pushdown languages. In: CONCUR- Concurrency Theory, 18th International Conference, pp. 476–491 (2007)Google Scholar
- 6.Brüggemann-Klein, A., Wood, D.: Deterministic regular languages. In: STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings, pp. 173–184 (1992)Google Scholar
- 10.Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. A Guide to Current Research. Springer (2002)Google Scholar
- 12.Kaiser, L.: Synthesis for structure rewriting systems. In: Rastislav Královic and Damian Niwinski, editors, MFCS, volume 5734 of Lecture Notes in Computer Science, pp. 415–426. Springer (2009)Google Scholar
- 19.Schuster, M., Schwentick, T.: Games for active XML revisited. In: 18th International Conference on Database Theory, ICDT 2015, pp. 60–75 (2015)Google Scholar
- 21.Waldmann, J.: Rewrite games. In: Tison, S. (ed.) RTA, volume 2378 of Lecture Notes in Computer Science, pp. 144–158. Springer (2002)Google Scholar