Approximate denial constraints
نویسندگان
چکیده
منابع مشابه
Discovering Denial Constraints
Integrity constraints (ICs) provide a valuable tool for enforcing correct application semantics. However, designing ICs requires experts and time. Proposals for automatic discovery have been made for some formalisms, such as functional dependencies and their extension conditional functional dependencies. Unfortunately, these dependencies cannot express many common business rules. For example, a...
متن کاملApproximate Deadline-Scheduling with Precedence Constraints
We consider the classic problem of scheduling a set of n jobs non-preemptively on a singlemachine. Each job j has non-negative processing time, weight, and deadline, and a feasibleschedule needs to be consistent with chain-like precedence constraints. The goal is to computea feasible schedule that minimizes the sum of penalties of late jobs. Lenstra and Rinnoy Kan[Annals of ...
متن کاملApproximate inference techniques with expectation constraints
This article discusses inference problems in probabilistic graphical models that often occur in a machine learning setting. In particular it presents a unified view of several recently proposed approximation schemes. Expectation consistent approximations and expectation propagation are both shown to be related to Bethe free energies with weak consistency constraints, i.e. free energies where lo...
متن کاملPushing Aggregate Constraints by Divide-and-Approximate
Iceberg-cube mining is to compute the GROUP BY partitions, for all GROUP BY dimension lists, that satisfy a given aggregate constraint. Previous works have pushed anti-monotone constraints into iceberg-cube mining. However, many useful constraints are not anti-monotone. In this paper, we propose a novel strategy for pushing general aggregate constraints, called Divide-and-Approximate. This stra...
متن کاملApproximate Controlability by Control Constraints for Infinite Dimensional Systems
For linear infinite systems the approximate controllability problem by control constraints is considered. Controllability conditions represented via system parameters are obtained. Partial differential control systems and control systems with delays are considered as an example. 1 Problem statement Let X, Y, U , be complex Banach spaces. Consider the abstract evolution equation ẋ(t) = Ax(t) +Bu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2020
ISSN: 2150-8097
DOI: 10.14778/3401960.3401966