Increasing the expressivity of Conditional Functional Dependencies without extra complexity

The paper proposes an extension of CFDS [1], referred to as extended Conditional Functional Dependencies (eCFDS). In contrast to CFDs, CCFDS specify patterns of semantically related values in terms of disjunction and inequality, and are capable of catching inconsistencies that arise in practice but cannot be detected by CFDs. The increase in expressive power does not incur extra complexity: we show that the satisfiability and implication analyses of eCFDs remain NP -complete and CONP -complete, respectively, the same as their CFDS counterparts. In light of the intractability, we present an algorithm that approximates the maximum number of CCFDS that are satisfiable. In addition, we revise SQL techniques for detecting CFD violations, and show that violations of multiple CCFDS can be captured via a single pair of SQL queries. We also introduce an incremental SQL technique for detecting eCFD violations in response to database updates. We experimentally verify the effectiveness and efficiency of our SQL -based detection methods.