The discovery of functional dependencies from relations is an important database analysis technique. We present TANE, an efficient algorithm for finding functional dependencies from large databases. TANE is based on partitioning the set of rows with respect to their attribute values, which makes testing the validity of functional dependencies fast even for a large number of tuples. The use of p...

A lattice theoretic approach is developed to study the properties of functional dependencies in relational databases. The particular attention is paid to the analysis of the semilattice of closed sets, the lattice of all closure operations on a given set and to a new characterization of normal form relation schemes. Relation schemes with restrictions on functional dependencies are also studied.

Product catalogues are usually represented as tables. They are regularly updated with new variants and, over time, various forms of inconsistencies or undesirable properties can be introduced, especially when global changes are made. We argue that by compiling product catalogues into decision diagrams we can support a number of highlevel queries for detecting and checking for various forms of i...

Knowledge discovery in databases can be enhanced by augmenting them with \catalytic relations" conveying external common sense knowledge. Catalytic inference analysis ? the systematic analysis of inference closures in databases augmented with catalytic information ? uncovers new facts and rules, and latent inference channels. This paper presents a formalism for analyzing imprecise inference bas...

XML data inconsistency has become a serious problem since XML was widely adopted as a standard for data representation on the web. XML-based standards such as OASIS, xCBL and xBRL have been used to report and exchange business and financial information. Such standards focus on technical rather than semantic aspects. XML Functional Dependencies (XFDs) have been introduced to improve XML semantic...

In this paper, we propose a new similarity measure between vague sets and apply vague logic in a relational database environment with the objective of capturing the vagueness of the data. By introducing a new vague Similar Equality (SEQ) for comparing data values, we first generalize the classical Functional Dependencies (FDs) into Vague Functional Dependencies (VFDs). We then present a set of ...

The paper studies properties of functional dependencies between strategies of players in Nash equilibria of multi-player strategic games. The main focus is on the properties of functional dependencies in the context of a fixed dependency graph for pay-off functions. A logical system describing properties of functional dependence for any given graph is proposed and is proven to be complete.

A fuzzification of the concept of functional dependency based on t-norms is presented. T-norms are equally used in the definition of the similarity relations in the domains and in the fuzziness degree assigned to functional dependencies. A sound and complete logic for this fuzzy functional dependencies is also introduced and, finally, its applicability to redundancy removing is shown.

We introduce an extension of the n-ary description logic DLR to deal with attribute-labelled tuples (generalising the positional notation), with arbitrary projections of relations (inclusion dependencies), generic functional dependencies and with global and local objectification (reifying relations or their projections). We show how a simple syntactic condition on the appearance of projections ...