Evaluation and enumeration problems for regular path queries
From MaRDI portal
Publication:3305367
Abstract: Evaluation of regular path queries (RPQs) is a central problem in graph databases. We investigate the corresponding enumeration problem, that is, given a graph and an RPQ, enumerate all paths in the graph that match the RPQ. We consider several versions of this problem, corresponding to different semantics of RPQs that have recently been considered: arbitrary paths, shortest paths, simple paths, and trails. Whereas arbitrary and shortest paths can be enumerated in polynomial delay, the situation is much more intricate for simple paths and trails. For instance, already the question if a given graph contains a simple path or trail of a certain length has cases with highly non-trivial solutions and cases that are long-standing open problems. In this setting, we study RPQ evaluation from a parameterized complexity perspective. We define a class of simple transitive expressions that is prominent in practice and for which we can prove two dichotomy-like results: one for simple paths and one for trails paths. We observe that, even though simple path semantics and trail semantics are intractable for RPQs in general, they are feasible for the vast majority of the kinds of RPQs that users use in practice. At the heart of this study is a result of independent interest on the parameterized complexity of finding disjoint paths in graphs: the two disjoint paths problem is W[1]-hard if parameterized by the length of one of the two paths.
Recommendations
Cites work
- scientific article; zbMATH DE number 1261119 (Why is no real title available?)
- scientific article; zbMATH DE number 910913 (Why is no real title available?)
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- Automata, Languages and Programming
- Color-coding
- Efficient computation of representative families with applications in parameterized and exact algorithms
- Efficient enumeration of words in regular languages
- Finding Regular Simple Paths in Graph Databases
- Finding the K Shortest Loopless Paths in a Network
- Finding two edge-disjoint paths with length constraints
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
- Parameterized Approximability of the Disjoint Cycle Problem
- Parameterized algorithms
- Parameterized tractability of edge-disjoint paths on directed acyclic graphs
- Querying Graphs with Data
- Relative expressive power of navigational querying on graphs using transitive closure
- The complexity of computing the permanent
- The complexity of regular expressions and property paths in SPARQL
- The directed subgraph homeomorphism problem
- The even-path problem for graphs and digraphs
Cited in
(13)- Regular path queries on large graph data
- On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules
- scientific article; zbMATH DE number 2241907 (Why is no real title available?)
- Evaluating regular path queries on compressed adjacency matrices
- scientific article; zbMATH DE number 5808834 (Why is no real title available?)
- scientific article; zbMATH DE number 7350780 (Why is no real title available?)
- A Trichotomy for Regular Trail Queries
- Formal language constrained path problems
- scientific article; zbMATH DE number 7561597 (Why is no real title available?)
- Fine-Grained Complexity of Regular Path Queries
- A trichotomy for regular simple path queries on graphs
- Finding Regular Simple Paths in Graph Databases
- Jumping evaluation of nested regular path queries
This page was built for publication: Evaluation and enumeration problems for regular path queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3305367)
