Given two sets of attributes X and Y, an imprecise functional dependency between them is denoted by X ? Y. The constraint says that, for any two tuples t1 and t2 having t1[X] similar to t2[X], then t1[Y] is similar to t2[Y]. More precisely, given a table R, IFD: X ? Y ? ?t1, t2 ? R.(RESX(t1[X], t2[X] ?f RESY(t1[Y], t2[Y]).
Published in Chapter:
Imprecise Functional Dependencies
Vincenzo Deufemia (Università di Salerno, Italy), Giuseppe Polese (Università di Salerno, Italy), and Mario Vacca (Università di Salerno, Italy)
Copyright: © 2009
|Pages: 9
DOI: 10.4018/978-1-60566-242-8.ch022
Abstract
Functional dependencies represent a fundamental concept in the design of a database since they are capable of capturing some semantics of the data strongly connected with the occurrence of redundancy in a database. The development of applications working on fuzzy and multimedia databases has required the extension of the functional dependency notion to these new types of data. Unfortunately, the concept of imprecise functional dependence or fuzzy functional dependence (IFD, for short) has not had a cogent and largely accepted definition yet. In fact, in attempt to capture different aspects of this notion of many proposals of IFD definition exist in literature, all having semantics and objectives somewhat unclear, especially with respect to the concern of redundancy (Bosc, et al., 1994, Cubero & Vila, 1994, Raju & Majumdar, 1988, Tyagi, et al., 2005, Wang, et al., 2000). Moreover, the debate on the definition of the concept of fuzzy functional dependency seems to be still in progress, as shown by the following question: “But the question remains: are these extended notions of functional dependency a natural generalization?” (Tyagi et al., 2005).