12 citations · 16 across the 4 of their papers we have counts for
4 papers
Querying Incomplete Data : Complexity and Tractability via Datalog and First-Order Rewritings
Amélie Gheerbrant, Leonid Libkin, Alexandra Rogova +1
To answer database queries over incomplete data the gold standard is finding certain answers: those that are true regardless of how incomplete data is interpreted. Such answers can…
A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join
Anantha Padmanabha, Luc Segoufin, Cristina Sirangelo
We consider the dichotomy conjecture for consistent query answering under primary key constraints. It states that, for every fixed Boolean conjunctive query q, testing whether q is…
A Simple Algorithm for Consistent Query Answering under Primary Keys
Diego Figueira, Anantha Padmanabha, Luc Segoufin +1
We consider the dichotomy conjecture for consistent query answering under primary key constraints. It states that, for every fixed Boolean conjunctive query q, testing whether q is…
Datalog Rewritings of Regular Path Queries using Views
Nadime Francis, Luc Segoufin, Cristina Sirangelo
We consider query answering using views on graph databases, i.e. databases structured as edge-labeled graphs. We mainly consider views and queries specified by Regular Path Queries…