Advertisement

Theory of Computing Systems

, Volume 61, Issue 1, pp 84–155 | Cite as

Games for Active XML Revisited

  • Martin SchusterEmail author
  • Thomas Schwentick
Article
  • 146 Downloads

Abstract

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.

Keywords

Active XML Computational complexity Nested words Rewriting games Semistructured data 

Notes

Acknowledgments

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 [15] as part of his Master’s thesis.

References

  1. 1.
    Abiteboul, S., Benjelloun, O., Milo, T.: The active XML project: an overview. VLDB J. 17(5), 1019–1040 (2008)CrossRefGoogle Scholar
  2. 2.
    Abiteboul, S., Milo, T., Benjelloun, O.: Regular rewriting of active XML and unambiguity (2005)Google Scholar
  3. 3.
    Rajeev, A., Madhusudan, P.: Adding nesting structure to words. J. ACM 56(3) (2009)Google Scholar
  4. 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. 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. 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
  7. 7.
    Chandra, A.K., Kozen, D., Stockmeyer, L.J.: Alternation. J. ACM 28 (1), 114–133 (1981)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Chlebus, B.S.: Domino-tiling games. J. Comput. Syst. Sci. 32(3), 374–392 (1986)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Goldschlager, L.M.: The monotone and planar circuit value problems are log space complete for P. ACM SIGACT News 9(2), 25–29 (1977)CrossRefzbMATHGoogle Scholar
  10. 10.
    Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. A Guide to Current Research. Springer (2002)Google Scholar
  11. 11.
    Jones, N.D., Laaser, W.T.: Complete problems for deterministic polynomial time. Theor Comput. Sci. 3(1), 105–117 (1976)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 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
  13. 13.
    Martens, W., Neven, F., Schwentick, T.: Complexity of decision problems for XML schemas and chain regular expressions. SIAM J. Comput. 39(4), 1486–1530 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Martens, W., Neven, F., Schwentick, T., Geert, J.B.: Expressiveness and complexity of XML schema. ACM Trans. Database Syst. 31(3), 770–813 (2006)CrossRefGoogle Scholar
  15. 15.
    Milo, T., Abiteboul, S., Amann, B., Benjelloun, O., Dang Ngoc, F., Exchanging intensional XML data. ACM Trans. Database Syst. 30(1), 1–40 (2005)CrossRefGoogle Scholar
  16. 16.
    Murata, M., Lee, D., Mani, M., Kawaguchi, K.: Taxonomy of XML schema languages using formal language theory. ACM Trans. Internet Techn. 5(4), 660–704 (2005)CrossRefGoogle Scholar
  17. 17.
    Muscholl, A., Schwentick, T., Segoufin, L., Active context-free games. Theory Comput. Syst. 39(1), 237–276 (2006)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Pauly, M., Parikh, R.: Game logic - an overview. Stud. Logica. 75(2), 165–182 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 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
  20. 20.
    Johan, V.B.: Logic games are complete for game logics. Stud. Logica. 75(2), 183–203 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 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
  22. 22.
    Walukiewicz, I.: Pushdown processes: Games and model-checking. Inf. Comput. 164(2), 234–263 (2001)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.TU DortmundDortmundGermany

Personalised recommendations