… more general Denial Constraints (DCs). In this paper, we investigate the problem of mining
approximate DCs (… Considering approximate constraints allows us to discover more accurate …

… Discovering approximate DCs is even more challenging than discovering exact DCs: It …
denial constraint finder (DCFINDER), a novel algorithm to efficiently discover both approximate …

… We investigate the problem of discovering approximate denial … and in the second phase
approximate DCs are found by leveraging … (2) Our solution to approximate DC discovery from the …

… To handle datasets that may have data errors, we extend FASTDC to discover approximate
constraints. Finally, we further extend it to discover DCs involving constant values. …

… An approximate DC is a DC partially satisfied in a relation instance. The term “partial” refers
to a relaxation in the constraint definition. Following related work [17], we use approximation …

… denial constraints (DCs), a powerful type of data dependency that generalizes keys, functional
dependencies, and order dependencies while capturing further constraints … approximate …

… [19] adapts a hitting set enumeration algorithm MMCS to enumerate all approximate hitting …
set building and a novel method to discover approximate DCs from the evidence set. Different …

… We investigate the problem of incremental denial constraint (… approximate DCs that hold
with some exceptions, and [12, 43] study methods for discovering both exact and approximate …

… databases with respect to denial constraints by fixing integer … We also develop approximation
algorithms for the latter. … are denial constraints; and sets of denials are always finite. …

… We express constraints using the denial constraint (DC) formal… relevant types of constraints,
including unique constraints, functional … The set of DCs contains both approximate DCs (with …