Saturation, Definability, and Separation for XPath on Data Trees

Download Now
Provided by: RWTH Aachen University
Topic: Data Management
Format: PDF
In this paper, the authors study the expressive power of some fragments of XPath equipped with inequality tests over data trees. The authors' main results are the definability theorems, which give necessary and sufficient conditions under which a class of data trees can be defined by a node expression or set of node expressions, and their separation theorems, which give sufficient conditions under which two disjoint classes of data trees can be separated by a class of data trees definable in XPath.
Download Now

Find By Topic