We study the expressive power of the downward and vertical fragments of XPath equipped with (in)equality tests over data trees. We give necessary and sufficient conditions for a class of pointed data trees to be definable ...

In this paper we introduce sound and strongly complete axiomatizations for XPath with data constraints extended with hybrid operators. First, we present HXPath=, a multi-modal version of XPath with data, extended with ...

Applications of description logics (DLs) such as OWL 2 and ontologybased data access (OBDA) require understanding of how to pose database queries over DL knowledge bases. While there have been many studies regarding ...

Extensible Markup Language (XML) documents consist of text data plus structured data (markup). XPath allows to query both text and structure. Evaluating such hybrid queries is challenging. We present a system for in-memory ...

We study the expressive power of the downward and vertical fragments of XPath equipped with (in)equality tests over possibly infinite data trees. We introduce a suitable notion of saturation with respect to node expressions, ...

We give sound and complete axiomatizations for XPath with data tests by ‘equality’ or ‘inequality’, and containing the single ‘child’ axis. This data-aware logic predicts over data trees, which are tree-like structures ...

The eXtensible Markup Language (XML) is acknowledged as the de facto standard for semistructured data representation and data exchange on the Web and many other scenarios. A well-known shortcoming of XML is its verbosity, ...

We investigate model theoretic properties of XPath with data (in)equality tests over the class of data trees, i.e., the class of trees where each node contains a label from a finite alphabet and a data value from an infinite ...

En este trabajo se presenta un cálculo correcto y completo para XPath con datos y caminos descendentes, enriquecido con nominales y operadores de satisfacción. Llamaremos HXPath = (↓) al lenguaje híbrido que resulta de ...

En esta tesis se presenta un framework que permite, a aplicaciones cliente, realizar consultas a bases de datos relacionales a través de internet, tendiendo a hacer transparente el diseño lógico de la base de datos. El ...