Evolving Schemas for Streaming XML

  • Maryam Shoaran
  • Alex Thomo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5956)


In this paper we model schema evolution for XML by defining formal language operators on Visibly Pushdown Languages (VPLs). Our goal is to provide a framework for efficient validation of streaming XML in the realistic setting where the schemas of the exchanging parties evolve and thus diverge from one another. We show that Visibly Pushdown Languages are closed under the defined language operators and this enables us to expand the schemas (for XML) in order to account for flexible or constrained evolution.


XML schemas Evolution Streaming Data Visibly Pushdown Languages 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alur, R., Arenas, M., Etessami, K., Immerman, N., Libkin, L.: First-Order and Temporal Logics for Nested Words. Logical Methods in Computer Science 4(4) (2008)Google Scholar
  2. 2.
    Arenas, M., Barcelo, P., Libkin, L.: Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization. In: Proc. 34th International Colloquium on Automata, Languages and Programming, Wroclaw, Poland, July 9-13, pp. 888–900 (2007)Google Scholar
  3. 3.
    Alur, R., Madhusudan, P.: Visibly Pushdown Languages. In: Proc. 36th ACM Symp. on Theory of Computing, Chicago, Illinois, June 13-15, pp. 202–211 (2004)Google Scholar
  4. 4.
    Alur, R.: Marrying Words and Trees. In: Proc. 26th ACM Symp. on Principles of Database Systems, Beijing, China, June 11-13, pp. 233–242 (2007)Google Scholar
  5. 5.
    Boobna, U., de Rougemont, M.: Correctors for XML Data. In: Proc. 2nd International XML Database Symposium, Toronto, Canada, August 29-30, pp. 97–111 (2004)Google Scholar
  6. 6.
    Clark, J., Murata, M.: RELAX NG Specification. OASIS (December 2001)Google Scholar
  7. 7.
    Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Löding, C., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications, October 12 (2007),
  8. 8.
    Daley, M., Ibarra, H.: Closure and decidability properties of some language classes with respect to ciliate bio-operations. Theor. Comput. Sci. 306(1-3), 19–38 (2003)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Flesca, S., Furfaro, F., Greco, S., Zumpano, E.: Querying and Repairing Inconsistent XML Data. In: Proc. 6th International Conference on Web Information Systems Engineering, New York, USA, November 20-22, pp. 175–188 (2005)Google Scholar
  10. 10.
    Gauwin, O., Caron, A.C., Niehren, J., Tison, S.: Complexity of Earliest Query Answering with Streaming Tree Automata. In: PLAN-X, San Francisco (January 2008)Google Scholar
  11. 11.
    Grahne, G., Thomo, A.: Approximate Reasoning in Semistructured Data. In: Proc. of the 8th International Workshop on Knowledge Representation meets Databases, Rome, Italy, September 15 (2001)Google Scholar
  12. 12.
    Grahne, G., Thomo, A.: Query Answering and Containment for Regular Path Queries under Distortions. In: Proc. of 3rd International Symposium on Foundations of Information and Knowledge Systems, Wilhelmminenburg Castle, Austria, February 17-20, pp. 98–115 (2004)Google Scholar
  13. 13.
    Grahne, G., Thomo, A.: Regular Path Queries under Approximate Semantics. Ann. Math. Artif. Intell. 46(1-2), 165–190 (2006)CrossRefzbMATHMathSciNetGoogle Scholar
  14. 14.
    Kari, L.: On Insertion and Deletion in Formal Languages. University of Turku, Department of Mathematics, Turku, Finland (1991)Google Scholar
  15. 15.
    Kumar, V., Madhusudan, P., Viswanathan, M.: Visibly Pushdown Automata for Streaming XML. In: Proc. of Int. Conf. on World Wide Web, Alberta, Canada, May 8-12, pp. 1053–1062 (2007)Google Scholar
  16. 16.
    Martens, W., Neven, F., Schwentick, T., Bex, G.J.: Expressiveness and complexity of XML Schema. ACM Trans. Database Syst. 31(3), 770–813 (2006)CrossRefGoogle Scholar
  17. 17.
    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
  18. 18.
    Raskin, J.F., Servais, F.: Visibly Pushdown Transducers. In: Proc. 35th International Colloquium on Automata, Languages and Programming, Reykjavik, Iceland, July 7-11, pp. 386–397 (2008)Google Scholar
  19. 19.
    Schwentick, T.: Automata for XML - A survey. J. Comput. Syst. Sci. 73(3), 289–315 (2007)CrossRefzbMATHMathSciNetGoogle Scholar
  20. 20.
    Segoufin, L., Vianu, V.: Validating Streaming XML Documents. In: Proc. 21st ACM Symp. on Principles of Database Systems, Madison, Wisconsin, June 3-5, pp. 53–64 (2002)Google Scholar
  21. 21.
    Sperberg-McQueen, C.M., Thomson, H.: XML Schema 1.0 (2005),
  22. 22.
    Staworko, S.: Personal Communication (2008)Google Scholar
  23. 23.
    Staworko, S., Chomicki, J.: Validity-Sensitive Querying of XML Data-bases. In: Proc. of 2nd International Workshop on Database Technologies for Handling XML Information on the Web, EDBT Workshops, Munich, Germany, March 26–31, pp. 164–177 (2006)Google Scholar
  24. 24.
    Staworko, S., Filiot, E., Chomicki, J.: Querying Regular Sets of XML Documents. In: Logic in Databases, Rome, Italy, May 19-20 (2008)Google Scholar
  25. 25.
    Thomo, A., Venkatesh, S.: Rewriting of Visibly Pushdown Languages for XML Data Integration. In: Proc. 17th ACM Conference on Information and Knowledge Management, Napa Valley, CA, October 26-30, pp. 521–530 (2008)Google Scholar
  26. 26.
    Thomo, A., Venkatesh, S., Ye, Y.Y.: Visibly Pushdown Transducers for Approximate Validation of Streaming XML. In: Proc. 5th International Symposium on Foundations of Information and Knowledge Systems, Pisa, Italy, February 11-15, pp. 219–238 (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Maryam Shoaran
    • 1
  • Alex Thomo
    • 1
  1. 1.University of VictoriaVictoriaCanada

Personalised recommendations