Computing Optimal Repairs for Functional Dependencies
نویسندگان
چکیده
منابع مشابه
Computing Optimal Repairs for Functional Dependencies
We investigate the complexity of computing an optimal repair of an inconsistent database, in the case where integrity constraints are Functional Dependencies (FDs). We focus on two types of repairs: an optimal subset repair (optimal S-repair) that is obtained by a minimum number of tuple deletions, and an optimal update repair (optimal U-repair) that is obtained by a minimum number of value (ce...
متن کاملComputing Functional Dependencies with Pattern Structures
The treatment of many-valued data with FCA has been achieved by means of scaling. This method has some drawbacks, since the size of the resulting formal contexts depends usually on the number of different values that are present in a table, which can be very large. Pattern structures have been proved to deal with many-valued data, offering a viable and sound alternative to scaling in order to r...
متن کاملGranular Computing on Extensional Functional Dependencies for Information System
Structure of Rough Approximations Based on Molecular Lattices p. 69 Rough Approximations under Level Fuzzy Sets p. 78 Fuzzy-Rough Modus Ponens and Modus Tollens as a Basis for Approximate Reasoning p. 84 Logic and Rough Sets Rough Truth, Consequence, Consistency and Belief Revision p. 95 A Note on Ziarko's Variable Precision Rough Set Model and Nonmonotonic Reasoning p. 103 Fuzzy Reasoning Base...
متن کاملThe Complexity of Computing a Cardinality Repair for Functional Dependencies
For a relation that violates a set of functional dependencies, we consider the task of finding a maximum number of pairwise-consistent tuples, or what is known as a “cardinality repair.” We present a polynomial-time algorithm that, for certain fixed relation schemas (with functional dependencies), computes a cardinality repair. Moreover, we prove that on any of the schemas not covered by the al...
متن کاملOn generating near-optimal tableaux for conditional functional dependencies
Conditional functional dependencies (CFDs) have recently been proposed as a useful integrity constraint to summarize data semantics and identify data inconsistencies. A CFD augments a functional dependency (FD) with a pattern tableau that defines the context (i.e., the subset of tuples) in which the underlying FD holds. While many aspects of CFDs have been studied, including static analysis and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Database Systems
سال: 2020
ISSN: 0362-5915,1557-4644
DOI: 10.1145/3360904