Relational decomposition through partial functional dependencies

  • Authors:

  • F. Berzal;J. C. Cubero;F. Cuenca;J. M. Medina

  • Affiliations:

  • Department of Computer Science and Artificial Intelligence, University of Granada, Avenida de Andalucia 38, 18071 Granada, Spain;Department of Computer Science and Artificial Intelligence, University of Granada, Avenida de Andalucia 38, 18071 Granada, Spain;Xfera Spain;Department of Computer Science and Artificial Intelligence, University of Granada, Avenida de Andalucia 38, 18071 Granada, Spain

  • Venue:
  • Data & Knowledge Engineering
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper introduces a new approach to database design theory. It presents the concept of partial functional dependency in the relational database framework. This new kind of dependency is an extension to the classical definition of functional dependency. The extension is carried out following two basic ideas. First, the new dependency works over relations (not over schemes). And, second, a relation can partially verify a classical dependency in the sense that only some tuples, called exceptions, break the dependency. Throughout this work, we use that dependency to decompose relations through a more flexible and general decomposition process, and by iterating this process, we find a mechanism to extract knowledge from the original relation. We also give algorithms to implement usual operations and relational system maintenance.