Skip to main content

On Types for XML Query Language Xcerpt

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2901))

Abstract

Our intention is to provide a type system for rule languages used in web applications. In this work we deal with an XML query language Xcerpt. Our types are sets of documents. We represent XML data as so called data terms and propose a formalism to define sets of data terms. The formalism is a generalization of tree automata; the defined sets roughly correspond to sets of documents definable by means of XML schema languages, like DTD and XML Schema. The main contribution of this paper is an algorithm for computing the type of possible results of an Xcerpt rule, given the type of the database. The algorithm can be used to automatically check correctness of Xcerpt programs with respect to type specifications. For non recursive Xcerpt programs it can also be used to compute the type of program results.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berger, S., Bry, F., Schaffert, S., Wieser, C.: Xcerpt and visXcerpt: From patternbased to visual querying of XML and semistructured data. In: Proceedings of the 29th Intl. Conference on Very Large Databases (VLDB 2003) – Demonstrations Track, Berlin, Germany (2003)

    Google Scholar 

  2. Boley, H., Tabet, S., Wagner, G.: Design rationale of RuleML: A markup language for semantic web rules. In: Proc. Semantic Web Working Symposium (SWWS 2001), Stanford (2001), http://www.dfki.uni-kl.de/ruleml

  3. Brüggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Information and Computation 142(2), 182–206 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bry, F., Drabent, W., Maluszynski, J.: On subtyping of tree-structured data. Technical report, IDA, Linköpings universitet (2003), http://www.ipipan.waw.pl/~drabent/types.winter.03/

  5. Bry, F., Schaffert, S.: A gentle introduction into Xcerpt, a rule-based query and transformation language for XML. Technical Report PMS-FB-2002-11, Computer Science Institute, Munich, Germany (2002); Invited article at International Workshop on Rule Markup Languages for Business Rules on the Semantic Web

    Google Scholar 

  6. 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)

    Chapter  Google Scholar 

  7. Bry, F., Schaffert, S.: The XML query language Xcerpt: Design principles, examples, and semantics. In: Chaudhri, A.B., Jeckle, M., Rahm, E., Unland, R. (eds.) NODe-WS 2002. LNCS, vol. 2593, pp. 295–310. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Clark, J., Murata, M. (eds.): RELAX NG specification (December 2001), http://www.oasis-open.org/committees/relax-ng/spec-20011203.html

  9. 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/

  10. Drabent, W., Maluszynski, J., Pietrzak, P.: Using parametric set constraints for locating errors in CLP programs. Theory and Practice of Logic Programming 2(4-5), 549–610 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  11. Drabent, W., Miłkowska, M.: Proving correctness and completeness of normal programs — a declarative approach. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol. 2237, pp. 284–299. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  12. Extensible markup language (XML) 1.0 (second edition), W3C recommendation (October 6, 2000), http://www.w3.org/TR/REC-xml

  13. Fallside, D.C. (ed.): XML Schema part 0: Primer. W3C Recommendation (2001), http://www.w3.org/TR/xmlschema-0/

  14. Hopcroft, J.E., Ullmann, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  15. Hosoya, H., Vouillon, J., Pierce, B.C.: Regular expression types for XML. In: Proceedings of the International Conference on Functional Programming (ICFP), pp. 11–22 (2000); Full version under submission to TOPLAS

    Google Scholar 

  16. Murata, M., Lee, D., Mani, M., Kawaguchi, K.: Taxonomy of XML schema languages using formal language theory (2003) (submitted)

    Google Scholar 

  17. Wilk, A., Drabent, W.: On Types for XML Query Language Xcerpt, Appendix (2003), http://www.ida.liu.se/g-artwi/TypesForXML/appendix.pdf

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wilk, A., Drabent, W. (2003). On Types for XML Query Language Xcerpt. In: Bry, F., Henze, N., Małuszyński, J. (eds) Principles and Practice of Semantic Web Reasoning. PPSWR 2003. Lecture Notes in Computer Science, vol 2901. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24572-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24572-8_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20582-1

  • Online ISBN: 978-3-540-24572-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics