The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints

    ACM SIGMOD Conference on Principles of DB Systems, pp. 17-29, 2015.

    Cited by: 30|Bibtex|Views17|Links
    EI

    Abstract:

    A relational database is said to be uncertain if primary key constraints can possibly be violated. A repair (or possible world) of an uncertain database is obtained by selecting a maximal number of tuples without ever selecting two distinct tuples with the same primary key value. For any Boolean query q, CERTAINTY(q) is the problem that t...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments