How to Best Nest Regular Path Queries - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

How to Best Nest Regular Path Queries


Regular path queries (RPQs) define query patterns in terms of regu-lar expressions and are therefore well-suited to query for paths over roles in DL. RPQs can be extended to 2-way RPQs (with converse), CRPQs (with conjunc-tions), or PRPQs (arbitrary positive Boolean combinations), all of which have been explored in DL research. Another natural extension of any query language is nesting, where query predicates can be defined in terms of subqueries. In this pa-per, we discuss several ways of introducing nesting to PRPQs, and show that they lead to increasingly expressive query languages: CN2RPQs, which were stud-ied in the context of DLs recently; nested P2RPQs; and positive queries with transitive closure on binary predicates. The latter is one of the most expressive languages for which query answering can still be decided over DL knowledge bases. We present initial complexity results that show query answering to be non-elementary in the worst case, with an exponential increase for each level of nest-ing of the transitive closure operator.
Fichier principal
Vignette du fichier
paper.pdf (138.45 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01098979 , version 1 (30-12-2014)


  • HAL Id : hal-01098979 , version 1


Pierre Bourhis, Markus Krötzsch, Sebastian Rudolph. How to Best Nest Regular Path Queries. Informal Proceedings of the 27th International Workshop on Description Logics, Jul 2014, Vienne, Austria. ⟨hal-01098979⟩
273 View
118 Download


Gmail Facebook X LinkedIn More