A Fixed-Point Query Language for XML

Authors:
Qing Wang;Klaus-Dieter Schewe;Bernhard Thalheim
Affiliations:
Information Science Research Centre, Palmerston North, New Zealand;Information Science Research Centre, Palmerston North, New Zealand;Christian Albrechts University, Institute of Computer Science, Kiel, Germany
Venue:
Proceedings of the 2010 conference on Information Modelling and Knowledge Bases XXI
Year:
2010

Citing 10
Cited 0

A semantics of multiple inheritance.

Proc. of the international symposium on Semantics of data types
Untyped sets, invention, and computable queries

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the equivalence of database restructurings involving object identifiers (extended abstract)

PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Datalog extensions for database queries and updates

Journal of Computer and System Sciences
Semi-determinism (extended abstract)

PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Formal aspects of object identity in database manipulation

Formal aspects of object identity in database manipulation
On the completeness of object-creating database transformation languages

Journal of the ACM (JACM)
Object identity as a query language primitive

Journal of the ACM (JACM)
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
A typed higher-order calculus for querying XML databases

ADC '08 Proceedings of the nineteenth conference on Australasian database - Volume 75

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to increase the expressiveness of XML query languages we define an XML object model that provides a rich description of XML data using the notions of class schema and class tuple. Based on this model we develop a novel query language, the XML Identity Query Language (XIQL) based on identifier generation and fixed-point computation. However, XIQL cannot deal with finite tree duplicates in an XML object graph. To solve this problem we extend XIQL by integrating terms $\breve{t}$ denoting hereditarily finite sets. With respect to determinate transformations the extended XIQL+ is still incomplete, but becomes complete with respect to a modified completeness criterion for XML database transformations, which aims at capturing more non-determinism.