Abstract
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.
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
Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques and Tools. Addison-Wesley, Reading (1986)
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)
Brown, A., Fuchs, M., Robie, J., Wadler, P.: MSL: A model for W3C XML Schema. In: Proc. of WWW10 (2001)
Brüggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Information and Computation 142(2), 182–206 (1998)
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)
Common, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1999), http://www.grappa.univ-lille3.fr/tata/
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation, 2nd edn. Addison-Wesley, Reading (2001)
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)
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”, http://www.ep.liu.se/ea/cis/2001/004/
Murata, M., Lee, D., Mani, M., Kawaguchi, K.: Taxonomy of XML schema languages using formal language theory (submitted) (2003)
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)
Extensible markup language (XML) 1.0 (second edition), W3C recommendation (2000), http://www.w3.org/TR/REC-xml
X.M.L Schema Part 0: Primer (2001), http://www.w3.org/TR/xmlschema-0/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bry, F., Drabent, W., Małuszyński, J. (2004). On Subtyping of Tree-Structured Data: A Polynomial Approach. In: Ohlbach, H.J., Schaffert, S. (eds) Principles and Practice of Semantic Web Reasoning. PPSWR 2004. Lecture Notes in Computer Science, vol 3208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30122-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-30122-6_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22961-2
Online ISBN: 978-3-540-30122-6
eBook Packages: Springer Book Archive