We present an algorithm to solve XPath decision problems under regular tree type
constraints and show its use to statically type-check XPath queries. To this end, we prove the …

In XML databases, the indexing process is based on a labelling or numbering scheme and
generally used to label an XML document to perform an XML query using the path node …

We show that problems arising in static analysis of XML specifications and transformations
can be dealt with using techniques similar to those developed for static analysis of …

Query containment is defined as the problem of determining if the result of a query is
included in the result of another query for any dataset. It has major applications in query …

We provide a benchmark collection of deterministic automata for regular XPath queries. For
this, we select the subcollection of forward navigational XPath queries from a corpus that …

Minification is a widely accepted technique that aims at reducing the size of the code
transmitted over the web. This article concerns the problem of semantic-preserving …

Abstract ShEx (Shape Expressions) is a language for expressing constraints on RDF
graphs. We consider the problem of SPARQL query containment in the presence of ShEx …

With increasing popularity and importance of Semantic Web and its application, SPARQL, as
a standard language for querying RDF data, gains more importance and receives additional …

Recursive graph queries are increasingly popular for extracting information from
interconnected data found in various domains such as social networks, life sciences, and …

We consider conditional graph patterns (CGPs) that allow querying data graphs with
complex features like quantification, negation and predicates. To overcome the prohibitive …