Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints

@article{Bertossi2005ComplexityAA,
  title={Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints},
  author={L. Bertossi and L. Bravo and Enrico Franconi and A. Lopatenko},
  journal={ArXiv},
  year={2005},
  volume={abs/cs/0503032}
}
  • L. Bertossi, L. Bravo, +1 author A. Lopatenko
  • Published 2005
  • Computer Science
  • ArXiv
  • Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole may fail to satisfy. Those answers are characterized as those that are invariant under minimal forms of restoring the consistency of the database. In this context, we study the problem of repairing databases by fixing integer numerical values at the attribute level with respect to denial and aggregation constraints. We… CONTINUE READING
    Repair-Based Degrees of Database Inconsistency
    7
    Answers in the Presence of Universal Constraints ?
    Consistent query answers in the presence of universal constraints
    43
    Optimizing and implementing repair programs for consistent query answering in databases
    13
    Querying and repairing inconsistent numerical databases
    47
    Efficient Approximation Algorithms for Repairing Inconsistent Databases
    62

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 52 REFERENCES
    Fixing Numerical Attributes Under Integrity Constraints
    12
    Condensed Representation of Database Repairs for Consistent Query Answering
    98
    Minimal-change integrity maintenance using tuple deletions
    336
    Scalar aggregation in inconsistent databases
    142
    Consistent query answers in inconsistent databases
    853