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

International Journal of Computer Mathematics

Volumn 88, Issue 9, 2011, Pages 1860-1868

  Mora, A ^a   De Guzman I P ^a   Enciso, M ^a   Cordero, P ^a  

^a UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

functional dependence; lattice theory; minimal key

Indexed keywords

EID: 79957696012     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160.2010.484488     Document Type: Conference Paper

References (16)

1. P. Cordero, M. Enciso, I.P. de Guzmán, and A. Mora, SLFD logic: Elimination of data redundancy in knowledge representation, in Advances in Artificial Intelligence - IBERAMIA 2002: 8th Ibero-American Conference on AI, Seville, Spain, November 12-15, 2002, Proceedings, Lecture Notes in Computer Science, Vol. 2527, F.J. Garijo, J.C. Riquelme Santos, and M. Toro, eds., Springer, Berlin, 2002, pp. 141-151.
2. P. Cordero, M. Enciso,A. Mora, and I.P. de Guzmán,A complete logic for fuzzy functional dependencies over domains with similarity relations, in Bio-Inspired Systems: Computational and Ambient Intelligence, 10th InternationalWork- Conference on Artificial Neural Networks, IWANN 2009, Salamanca, Spain, June 10-12, 2009, Proceedings, Part I 2009, Lecture Notes in Computer Science,Vol. 5517, J. Cabestany, F. Sandoval, A. Prieto, and J.M. Corchado, eds., Springer-Verlag, Berlin, Heidelberg, 2009, pp. 261-269.
3. P. Cordero, A. Mora, M. Enciso, and I.P. de Guzmán, Computing minimal keys using lattice theory, in Proceedings of the International Conference on Computational and Mathematical Methods in Science and Engineering, CMMSE 2009, 30 June, 1-3 July 2009, Gijón, Asturias, Spain,Vol. 1, J.Vigo Aguiar, ed., J.Vigo Aguiar y B.A.Wade Editores, Gijón - Asturias, Spain, 2009, pp. 288-299.
4. P. Cordero, A. Mora, I.P. de Guzmán, and M. Enciso, Non-deterministic ideal operators: An adequate tool for formalization in data bases, Discrete Appl. Math. 156(6) (2008), pp. 911-923. (Pubitemid 351273433)
5. P. Cordero, A. Mora, I.P. de Guzmán, M. Enciso, Reasoning about fuzzzy functional dependencies, in ESTYLF, European Centre for Soft Computing, ed., European Centre for Soft Computing: Mieres - Asturias, Spain, 2008, pp. 911-923.
6. P. Cordero, A. Mora, I.P. de Guzmán, and M. Enciso, A complete logic for fuzzy functional dependencies over t-norms, in ESTYLF, A. Peregrín Rubio, J. Alcalá Fernandez, F.J. Moreno Velo, and F.A. Márquez Fernández, eds., European Centre for Soft Computing, Huelva, Spain, 2010, pp. 210-215.
7. J.W. Guan and D.A. Bell, Rough computational methods for information systems,Artif. Intell. 105 (1998), pp. 77-103. (Pubitemid 128398274)
8. T. Hamrouni, P. Valtchev, S.Yahia, and E. Nguifo, About the lossless reduction of the minimal generator family of a context, in Proceedings of the 5th International Conference on Formal Concept Analysis (ICFCA 2007), Lecture Notes in Computer Science, Vol. 4390, S.O. Kuznetsov and S. Shmidt, eds., Springer-Verlag Berlin, Heidelberg, 2007, pp. 130-150.
9. S. Hartmann and S. Link, Deciding implication for functional dependencies in complex-value databases, Theoret. Comput. Sci. 364(2) (2006), pp. 212-240. (Pubitemid 44528877)
10. G. Katona and K. Tichler, Some contributions to the minimum representation problem of key systems, in Foundations of Information and Knowledge Systems, Fourth International Symposium, FoIKS 2006, Budapest, Hungary, February 14-17, 2006, Proceeding, Lecture Notes in Computer Science, Vol. 3861, J. Dix and S.J. Hegner, eds., Springer- Verlag, Berlin, pp. 240-257. (Pubitemid 43973751)
11. G. Katona, A. Sali, and K. Schewe, TANE: An codes that attain minimum distance in every possible direction, Cent. Eur. J. Math. 6(1) (2008), pp. 1-11.
12. R.S. King and J.J. Legendre, Discovery of functional and approximate functional dependencies in relational databases, J. Appl. Math. Decis. Syst. 7(1) (2003), pp. 49-59.
13. A. Sali, Minimal keys in higher-order datamodels, in: Foundations of Information and Knowledge Systems, Third International Symposium, FoIKS 2004, Wilhelminenburg Castle, Austria, February 17-20, 2004, Proceedings, Lecture Notes in Computer Science, Vol. 2942, D. Seipel and J.M. Turull Torres, eds., Springer-Verlag, Berlin, Heidelberg, pp. 242-251.
14. Y. Sismanis, P. Brown, P.J. Haas, and B. Reinwald, Gordian: Efficient and scalable discovery of composite keys, in Proceedings of the 32nd International Conference on Very Large Data Bases, Seoul, Korea, September 12-15, 2006, VLDB '06, U. Dayal, K.-Y. Whang, D.B. Lomet, G. Alonso, G.M. Lohman, M.L. Kersten, S.K. Cha, Y.-K. Kim, eds., VLDB Endowment, 2006, pp. 691-182. Available at http://portal.acm.org/citation.cfm?id=1164187.
15. K. Tichler, Extremal theorems for databases, Ann. Math. Artif. Intell. 40(1) (2004), pp. 165-182. (Pubitemid 38103550)
16. S. Torgersen, Automatic design of relational databases, Ph.D. thesis, TR 89-1038, 1989.