PAIRPQ: An Efficient Path Index for Regular Path Queries on Knowledge Graphs

2021 ◽  
pp. 106-120
Author(s):  
Baozhu Liu ◽  
Xin Wang ◽  
Pengkai Liu ◽  
Sizhuo Li ◽  
Xiaofei Wang
Keyword(s):  
Path Index ◽  
Regular Path ◽  
Regular Path Queries ◽  
Knowledge Graphs ◽  
Path Queries

scholarly journals Algebraic rewritings for optimizing regular path queries

2003 ◽  
Vol 296 (3) ◽  
pp. 453-471 ◽  
Author(s):  
Gösta Grahne ◽  
Alex Thomo
Keyword(s):  
Regular Path ◽  
Regular Path Queries ◽  
Path Queries

scholarly journals Expressiveness and static analysis of extended conjunctive regular path queries

2013 ◽  
Vol 79 (6) ◽  
pp. 892-909 ◽  
Author(s):  
Dominik D. Freydenberger ◽  
Nicole Schweikardt
Keyword(s):  
Static Analysis ◽  
Regular Path ◽  
Regular Path Queries ◽  
Path Queries

scholarly journals Regular Path Queries with Constraints

1999 ◽  
Vol 58 (3) ◽  
pp. 428-452 ◽  
Author(s):  
Serge Abiteboul ◽  
Victor Vianu
Keyword(s):  
Regular Path ◽  
Regular Path Queries ◽  
Path Queries

scholarly journals Finite Controllability for Ontology-Mediated Query Answering of CRPQ

2020 ◽  
Author(s):  
Diego Figueira ◽  
Santiago Figueira ◽  
Edwin Pin Baque
Keyword(s):  
Query Answering ◽  
Graph Structure ◽  
First Order ◽  
Underlying Graph ◽  
Graph Classes ◽  
Regular Path ◽  
Order Constraints ◽  
Simple Recursion ◽  
Regular Path Queries ◽  
Path Queries

Finite ontology mediated query answering (FOMQA) is the variant of ontology mediated query answering (OMQA) where the represented world is assumed to be finite, and thus only finite models of the ontology are considered. We study the property of finite-controllability, that is, whether FOMQA and OMQA are equivalent, for fragments of C2RPQ. C2RPQ is the language of conjunctive two-way regular path queries, which can be regarded as the result of adding simple recursion to Conjunctive Queries. For graph classes S, we consider fragments C2RPQ(S) of C2RPQ as the queries whose underlying graph structure is in S. We completely classify the finitely controllable and non-finitely controllable fragments under: inclusion dependencies, (frontier-)guarded rules, frontier-one rules (either with or without constants), and more generally under guarded-negation first-order constraints. For the finitely controllable fragments, we show a reduction to the satisfiability problem for guarded-negation first-order logic, yielding a 2EXPTIME algorithm (in combined complexity) for the corresponding (F)OMQA problem.

Sign in / Sign up

Export Citation Format

Share Document