Quantifying the inconsistency of a database is motivated by various goals including reliability estimation for new datasets and progress indication in data cleaning. Another goal to attribute individual tuples level responsibility overall inconsistency, thereby prioritize explanation or inspection dirt. Therefore, quantification attribution have been subject much research Knowledge Representati...

A temporal nodes Bayesian network (TNBN) is an alternative graphical representation of temporal probabilistic information. The temporal functional dependency is an important data dependency in temporal relational databases. In this paper temporal data dependencies are extended into delayed conditions, called asynchronous dependencies. The purpose of this paper is to set up a connection between ...

We study the parameterized complexity of classical problems that arise in the profiling of relational data. Namely, we characterize the complexity of detecting unique column combinations (candidate keys), functional dependencies, and inclusion dependencies with the solution size as parameter. While the discovery of uniques and functional dependencies, respectively, turns out to be W [2]-complet...

Functional dependencies provide valuable knowledge on the relations between the attributes of a data table. To extend their use, generalizations have been proposed, among which purity and approximate dependencies. After discussing those generalizations, we provide an alternative definition, the similarity dependencies, to handle a similarity relation between data-values, hence un-crisping the b...

Functional dependencies (FDs) are an integral part of database theory since they are used in integrity enforcement and in database design. Recently, functional dependencies satisfied by XML data (XFDs) have been introduced. In this work approximate functional dependencies that are XFDs approximately satisfied by a considerable part of the XML database are defined and the problem of inferring su...

We establish a principled schema design framework for data with missing values. The is based on the new notion of an embedded functional dependency, which independent interpretation values, able to express completeness and integrity requirements application data, capable capturing redundant value occurrences that may cause problems processing meets requirements. axiomatic, algorithmic, logical ...

The article is devoted to the approximation problems of functional dependencies during conversions performed in intelligent measurement devices. Non-linearities are essential parts most control processes and systems. When using a nonlinear transmitter with conversion function information systems used various fields, it necessary perform operations on numbers microprocessors/microcontrollers dir...

Over the last twenty years, several algorithms have been proposed for automatic rule/constraint discovery from data, for the purpose of data cleaning. These algorithms look for constraints such as functional dependencies (FDs), conditional FDs (CFDs), inclusion dependencies (INDs), conditional INDs (CINDs), association rules, integrity constraints (ICs) and denial constraints (DCs), among other...