Consistent Query Answering for Primary Keys in Logspace

    ICDT 2019, Volume abs/1810.03386, 2019.

    Cited by: 4|Bibtex|Views1|Links
    EI

    Abstract:

    We study the complexity of consistent query answering on databases that may violate primary key constraints. A repair of such a database is any consistent database that can be obtained by deleting a minimal set of tuples. For every Boolean query q, CERTAINTY(q) is the problem that takes a database as input and asks whether q evaluates to ...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments