Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries
This result is significant for database theory and query optimization, as it resolves a complexity gap between recursive and non-recursive queries, though it is incremental in building on prior output-sensitive algorithms.
The paper tackles the problem of evaluating acyclic Conjunctive Regular Path Queries (CRPQs) by presenting an output-sensitive algorithm whose complexity matches that of the best known for corresponding conjunctive queries, showing that recursion in these queries does not increase complexity in output-sensitive analysis.
We present an output-sensitive algorithm for evaluating an acyclic Conjunctive Regular Path Query (CRPQ). Its complexity is written in terms of the input size, the output size, and a well-known parameter of the query that is called the "free-connex fractional hypertree width". Our algorithm improves upon the complexity of the recently introduced output-sensitive algorithm for acyclic CRPQs. More notably, the complexity of our algorithm for a given acyclic CRPQ Q matches the best known output-sensitive complexity for the "corresponding" conjunctive query (CQ), that is the CQ that has the same structure as the CRPQ Q except that each RPQ is replaced with a binary atom (or a join of two binary atoms). This implies that it is not possible to improve upon our complexity for acyclic CRPQs without improving the state-of-the-art on output-sensitive evaluation for acyclic CQs. Our result is surprising because RPQs, and by extension CRPQs, are equivalent to recursive Datalog programs, which are generally poorly understood from a complexity standpoint. Yet, our result implies that the recursion aspect of acyclic CRPQs does not add any extra complexity on top of the corresponding (non-recursive) CQs, at least as far as output-sensitive analysis is concerned.