15 citations · 22 across the 3 of their papers we have counts for
Showing cs.DBShow all
3 papers · 1 filter
cs.DB2019
A More General Theory of Static Approximations for Conjunctive Queries
Pablo Barceló, Miguel Romero, Thomas Zeume
Conjunctive query (CQ) evaluation is NP-complete, but becomes tractable for fragments of bounded hypertreewidth. Approximating a hard CQ by a query from such a fragment can thus al…
cs.DB2019★ 7 cited
Boundedness of Conjunctive Regular Path Queries
Pablo Barceló, Diego Figueira, Miguel Romero
We study the boundedness problem for unions of conjunctive regular path queries with inverses (UC2RPQs). This is the problem of, given a UC2RPQ, checking whether it is equivalent t…
cs.DB2016★ 15 cited
The complexity of reverse engineering problems for conjunctive queries
Pablo Barcelo, Miguel Romero
Reverse engineering problems for conjunctive queries (CQs), such as query by example (QBE) or definability, take a set of user examples and convert them into an explanatory CQ. Des…