An Efficient Algorithm for Reasoning about Fuzzy Functional Dependencies

Enciso, Manuel; Mora, Ángel; Guzmán, Inman P. de; Rodríguez‐Jiménez, Jose Manuel

doi:10.1007/978-3-642-21498-1_52

Cited by 5 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…3. and work that does not deal with simple values (fuzzy databases, where values can be fuzzy functions) [25,26,13,23,5].…”

Section: Related Workmentioning

confidence: 99%

On Desirable Semantics of Functional Dependencies over Databases with Incomplete Information

Badia

Lemire

2018

View full text Add to dashboard Cite

Codd's relational model describes just one possible world. To better cope with incomplete information, extended database models allow several possible worlds. Vague tables are one such convenient extended model where attributes accept sets of possible values (e.g., the manager is either Jill or Bob). However, conceptual database design in such cases remains an open problem. In particular, there is no canonical definition of functional dependencies (FDs) over possible worlds (e.g., each employee has just one manager). We identify several desirable properties that the semantics of such FDs should meet including Armstrong's axioms, the independence from irrelevant attributes, seamless satisfaction and implied by strong satisfaction. We show that we can define FDs such that they have all our desirable properties over vague tables. However, we also show that no notion of FD can satisfy all our desirable properties over a more general model (disjunctive tables). Our work formalizes a trade-off between having a general model and having well-behaved FDs.

show abstract

“…3. and work that does not deal with simple values (fuzzy databases, where values can be fuzzy functions) [25,26,13,23,5].…”

Section: Related Workmentioning

confidence: 99%

On Desirable Semantics of Functional Dependencies over Databases with Incomplete Information

Badia

Lemire

2018

View full text Add to dashboard Cite

show abstract

“…We have proposed a fuzzy operator of simplification [5] and a new logic for fuzzy FDs has been developed [2,6].…”

Section: The Scheme Pruning Transformationmentioning

confidence: 99%

Ideal non-deterministic operators as a formal framework to reduce the key finding problem

Mora

Guzmán

Enciso

2011

International Journal of Computer Mathematics

Self Cite

View full text Add to dashboard Cite

A formal development in the framework of the lattice theory for functional dependencies and minimal keys is presented. Beyond this theoretical study, a technique to prune the key finding problem, named scheme pruning transformation, is proposed in this work. This transformation is founded on theoretical results and has linear cost in the worst case. Moreover, this approach has provided a better size reduction than the usual techniques existing in the literature.

show abstract

Directness in Fuzzy Formal Concept Analysis

Enciso¹,

Mora²

2018

Communications in Computer and Information Science

View full text Add to dashboard Cite

An Efficient Algorithm for Reasoning about Fuzzy Functional Dependencies

Cited by 5 publications

References 11 publications

On Desirable Semantics of Functional Dependencies over Databases with Incomplete Information

On Desirable Semantics of Functional Dependencies over Databases with Incomplete Information

Ideal non-deterministic operators as a formal framework to reduce the key finding problem

Directness in Fuzzy Formal Concept Analysis

Contact Info

Product

Resources

About