Computing non-redundant sets of functional dependencies via simplification

 

Abstract

Functional dependencies may be considered the skeleton of the Relational Database Model. They describe binary relations between sets of attributes and they characterize the database structure. A way to ensure solid specifications is to transform set of functional dependencies into an equivalent one with less redundancy. In this work we consider a fuzzy extension of the notion of functional dependencies which is consistent with the Armstrong axioms. We improve the well known notion of Duquenne-Guigues basis by enriching the minimality criteria and we introduce a method to remove redundancy in the basis.

Citation

Please, cite this work as:

[Cor+13] P. Cordero, M. Enciso, Á. Mora, et al. “Computing non-redundant sets of functional dependencies via simplification”. In: IEEE Symposium on Foundations of Computational Intelligence, FOCI 2013, Singapore, Singapore, April 16-19, 2013. IEEE, 2013, pp. 9-14. DOI: 10.1109/FOCI.2013.6602449. URL: https://doi.org/10.1109/FOCI.2013.6602449.

BibTeX

@InProceedings{Cordero2013a,
     author = {Pablo Cordero and Manuel Enciso and {’A}ngel Mora and Jos{’e} Manuel Rodr'-Jim{’e}nez},
     booktitle = {{IEEE} Symposium on Foundations of Computational Intelligence, {FOCI} 2013, Singapore, Singapore, April 16-19, 2013},
     title = {Computing non-redundant sets of functional dependencies via simplification},
     year = {2013},
     pages = {9–14},
     publisher = {{IEEE}},
     bibsource = {dblp computer science bibliography, https://dblp.org},
     biburl = {https://dblp.org/rec/conf/foci/CorderoEMR13.bib},
     doi = {10.1109/FOCI.2013.6602449},
     timestamp = {Fri, 23 Sep 2022 01:00:00 +0200},
     url = {https://doi.org/10.1109/FOCI.2013.6602449},
}

Bibliometric data

The following data has been extracted from resources such as OpenAlex, Dimensions, PlumX or Altmetric.

Computing non-redundant sets of functional dependencies via simplification

Cites

The following graph plots the number of cites received by this work from its publication, on a yearly basis.

Papers citing this work

The following is a non-exhaustive list of papers that cite this work:

[1] P. Cordero, M. Enciso, A. Mora, et al. “Interactive Search by Using Minimal Generators”. In: Computational Intelligence and Mathematics for Tackling Complex Problems 2. Springer International Publishing, 2022, p. 147–153. ISBN: 9783030888176. DOI: 10.1007/978-3-030-88817-6_17. URL: http://dx.doi.org/10.1007/978-3-030-88817-6_17.

[2] P. Cordero, M. Enciso, Á. Mora, et al. “A Formal Concept Analysis Approach to Cooperative Conversational Recommendation”. In: International Journal of Computational Intelligence Systems 13.1 (2020), p. 1243. ISSN: 1875-6883. DOI: 10.2991/ijcis.d.200806.001. URL: http://dx.doi.org/10.2991/ijcis.d.200806.001.

[3] J. Triska and V. Vychodil. “Graded data dependencies in relational databases: Reasoning with similarity of time”. In: 2015 Annual Conference of the North American Fuzzy Information Processing Society (NAFIPS) held jointly with 2015 5th World Conference on Soft Computing (WConSC). IEEE, Aug. 2015, p. 1–6. DOI: 10.1109/nafips-wconsc.2015.7284170. URL: http://dx.doi.org/10.1109/nafips-wconsc.2015.7284170.