Effective query optimization is a core feature of any database management system. While
most query optimization techniques make use of simple metadata, such as cardinalities and …

We examine the issue of how to measure the degree to which a functional dependency (FD)
is approximate. The primary motivation lies in the fact that approximate FDs represent …

Multi-column dependencies in relational databases come associated with two different
computational tasks. The detection problem is to decide whether a dependency of a certain …

This paper examines algorithmic aspects of searching for approximate functional
dependencies in a database relation. The goal is to avoid exploration of large parts of the …

The discovery of dependencies between attributes in databases is an important problem in
data mining, and can be applied to facilitate future decision-making. In the present paper …

The amount of data stored in databases and the complexity of database workloads are ever-
increasing. Database management systems (DBMSs) offer many configuration options, such …

We consider the problem of defining a normalized approximation measure for multi-valued
dependencies in relational database theory. An approximation measure is a function …

The task of searching a powerset lattice is part of many problem domains. In Approximate
Functional Dependencies (AFDs) mining the algorithm used for searching lattices has been …

This paper presents the fundamental concepts underpinning MoLS, a framework for
exploring and applying many variations of algorithms for one datamining problem: mining a …

The rapid proliferation and growth of database management systems has resulted in the
retention of massive amounts of information for data processing and analysis needs. Many …