✦ LIBER ✦

Regular Path Queries with Constraints

✍ Scribed by Serge Abiteboul; Victor Vianu

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 310 KB
Volume: 58
Category: Article
ISSN: 0022-0000
DOI: 10.1006/jcss.1999.1627

No coin nor oath required. For personal study only.

✦ Synopsis

The evaluation of path expression queries on semistructured data in a distributed asynchronous environment is considered. The focus is on the use of local information expressed in the form of path constraints in the optimization of path expression queries. In particular, decidability and complexity results on the implication problem for path constraints are established.

📜 SIMILAR VOLUMES

Rewriting of Regular Expressions and Reg

Rewriting of Regular Expressions and Regular Path Queries

✍ Diego Calvanese; Giuseppe De Giacomo; Maurizio Lenzerini; Moshe Y. Vardi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 189 KB

Recent work on semi-structured data has revitalized the interest in path queries, i.e., queries that ask for all pairs of objects in the database that are connected by a path conforming to a certain specification, in particular to a regular expression. Also, in semi-structured data, as well as in da

Algebraic rewritings for optimizing regu

Algebraic rewritings for optimizing regular path queries

✍ Gösta Grahne; Alex Thomo 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 189 KB

Rewriting queries using views is a powerful technique that has applications in query optimization, data integration, data warehousing, etc. Query rewriting in relational databases is by now rather well investigated. However, in the framework of semistructured data the problem of rewriting has receiv

Processing queries with metrical constra

Processing queries with metrical constraints in XML-based IR systems

✍ Shmuel T. Klein 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 338 KB

## Abstract XML documents combine features from classical IR systems allowing free text, with explicit structures as in databases. Many query languages have been specially designed for IR applications on XML documents. This work concentrates on a special type of language for which the problem of pr

Conjunctive query containment with respe

Conjunctive query containment with respect to views and constraints

✍ Guozhu Dong; Jianwen Su 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 806 KB

Extending SPARQL with regular expression

Extending SPARQL with regular expression patterns (for querying RDF)

✍ Faisal Alkhateeb; Jean-François Baget; Jérôme Euzenat 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 840 KB

RDF is a knowledge representation language dedicated to the annotation of resources within the framework of the semantic web. Among the query languages for RDF, SPARQL allows querying RDF through graph patterns, i.e., RDF graphs involving variables. Other languages, inspired by the work in databases

Time-varying shortest path problems with

Time-varying shortest path problems with constraints

✍ Cai, X.; Kloks, T.; Wong, C. K. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB

We study a new version of the shortest path problem. Let G Å (V, E) be a directed graph. Each arc e √ E has two numbers attached to it: a transit time b(e, u) and a cost c(e, u), which are functions of the departure time u at the beginning vertex of the arc. Moreover, postponement of departure (i.e.