On Subtyping of Tree-Structured Data: A Polynomial Approach

  • François Bry
  • Włodzimierz Drabent
  • Jan Małuszyński
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3208)


This paper discusses subtyping of tree-structured data encountered on the Web, e.g. XML and HTML data. Our long range objective is to define a type system for Web and/or Semantic Web query languages amenable to static type checking. We propose a type formalism motivated by XML Schema and accommodating two concepts of subtyping: inclusion subtyping (corresponding to XML Schema notion of type restriction) and extension subtyping (motivated by XML Schema’s type extension). We present algorithms for checking both kinds of subtyping. The algorithms are polynomial if certain conditions are imposed on the type definitions; the conditions seem natural and not too restrictive.


Type Variable Regular Expression Data Pattern Data Term Basic Constant 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques and Tools. Addison-Wesley, Reading (1986)Google Scholar
  2. 2.
    Berger, S., Bry, F., Schaffert, S., Wieser, C.: Xcerpt and visXcerpt: From Pattern-Based to Visual Querying of XML and Semistructured Data. In: Proceedings of 29th Intl. Conference on Very Large Databases, Berlin, Germany, September 9–12 (2003) Google Scholar
  3. 3.
    Brown, A., Fuchs, M., Robie, J., Wadler, P.: MSL: A model for W3C XML Schema. In: Proc. of WWW10 (2001) Google Scholar
  4. 4.
    Brüggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Information and Computation 142(2), 182–206 (1998) Google Scholar
  5. 5.
    Bry, F., Schaffert, S.: Towards a declarative query and transformation language for XML and semistructured data: Simulation unification. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol. 2401, p. 255. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  6. 6.
    Common, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1999), Google Scholar
  7. 7.
    Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation, 2nd edn. Addison-Wesley, Reading (2001)Google Scholar
  8. 8.
    Hosoya, H., Vouillon, J., Pierce, B.C.: Regular expression types for XML. In: Proc. of the International Conference on Functional Programming, pp. 11–22. ACM Press, New York (2000) Google Scholar
  9. 9.
    Klein, M., Fensel, D., van Harmelen, F., Horrocks, I.: The relation between ontologies and XML schemas. Electronic Trans. on Artificial Intelligence (2001); Special Issue on the 1st International Workshop “Semantic Web: Models, Architectures and Management”, Google Scholar
  10. 10.
    Murata, M., Lee, D., Mani, M., Kawaguchi, K.: Taxonomy of XML schema languages using formal language theory (submitted) (2003) Google Scholar
  11. 11.
    Wilk, A., Drabent, W.: On types for XML query language xcerpt. In: Bry, F., Henze, N., Małuszyński, J. (eds.) PPSWR 2003. LNCS, vol. 2901, pp. 128–145. Springer, Heidelberg (2003) Google Scholar
  12. 12.
    Extensible markup language (XML) 1.0 (second edition), W3C recommendation (2000), Google Scholar
  13. 13.
    X.M.L Schema Part 0: Primer (2001), Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • François Bry
    • 1
  • Włodzimierz Drabent
    • 2
    • 3
  • Jan Małuszyński
    • 3
  1. 1.Institut für InformatikLudwig-Maximilians-Universität MünchenGermany
  2. 2.Institute of Computer SciencePolish Academy of SciencesWarszawaPoland
  3. 3.Department of Computer and Information ScienceLinköping UniversitySweden

Personalised recommendations