Communication Dans Un Congrès Année : 2024

A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join

Résumé

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 certain (i.e. whether it evaluates to true over all repairs of a given inconsistent database) is either PTime or CoNP-complete. This conjecture has been verified for self-join-free and path queries. We show that it also holds for queries with two atoms.

Dates et versions

hal-04577512 , version 1 (16-05-2024)

Identifiants

Citer

Anantha Padmanabha, Luc Segoufin, Cristina Sirangelo. A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join. PODS'24 - ACM Conference on Principle of Database Systems, Jun 2024, Santiago, Chile. pp.1-15, ⟨10.1145/3651137⟩. ⟨hal-04577512⟩
194 Consultations
0 Téléchargements

Altmetric

Partager

  • More