Sciweavers

EDBT
2009
ACM

Expressive, yet tractable XML keys

14 years 4 months ago
Expressive, yet tractable XML keys
Constraints are important for a variety of XML recommendations and applications. Consequently, there are numerous opportunities for advancing the treatment of XML semantics. In particular, suitable notions of keys will enhance XML’s capabilities of modeling, managing and processing native XML data. However, the different ways of accessing and comparing XML elements make it challenging to balance expressiveness and tractability. We investigate XML keys which uniquely identify XML elements based on a very general notion of value-equality: isomorphic subtrees with the identity on data values. Previously, an XML key fragment has been recognised that is robust in the sense that its implication problem can be expressed as the reachability problem in a suitable digraph. We analyse the impact of extending this fragment by structural keys that uniquely identify XML elements independently of any data. We establish a sound and complete set of inference rules for this expressive fragment of XM...
Sven Hartmann, Sebastian Link
Added 24 Jul 2010
Updated 24 Jul 2010
Type Conference
Year 2009
Where EDBT
Authors Sven Hartmann, Sebastian Link
Comments (0)