A Typed Higher-Order Calculus for Querying XML Databases

Wang, Q. and Schewe, K.-D.

    As the eXtensible Markup Language (XML) is about to emerge as a new standard for databases, the problem of providing solid logical grounds for XML query languages arises. For the relational data model first-order logic, i.e. the Relational Calculus turned out to be an intuitive basic approach to provide these foundations. For XML, however, it is necessary to deal with ordered trees. In this paper the problem is approached by viewing XML as a data model based on complex objects that are arranged in a class hierarchy. This results in the natural development of a higher-order type system for XML data, and henceforth a higher-order predicate typed logic, the XML calculus (XMLC). The paper presents the basics of the XML object model (XOM), the syntacs and semantics of XMLC, and discusses the expressiveness of the language by means of representative important query samples.
Cite as: Wang, Q. and Schewe, K.-D. (2008). A Typed Higher-Order Calculus for Querying XML Databases. In Proc. Nineteenth Australasian Database Conference (ADC 2008), Wollongong, NSW, Australia. CRPIT, 75. Fekete, A. and Lin, X., Eds. ACS. 103-113.
pdf (from crpit.com) pdf (local if available) BibTeX EndNote GS