A new closure algorithm based in logic: SLFD-closure versus classical closures

Inteligencia Artificial

Volumn 10, Issue 31, 2006, Pages 31-40

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

^a UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

Closure; Functional dependencies; Logic

Indexed keywords

EID: 33845578116     PISSN: 11373601     EISSN: None     Source Type: Journal    
DOI: 10.4114/ia.v10i31.935     Document Type: Article

References (33)

1. Gabriel Aguilera, Pablo Cordero, Manuel Enciso, Angel Mora, and I. P. de Guzmán. A non-explosive treatment of Functional dependencies using rewriting logic. LNAI 3171, Springer-Verlag (SBIA 2004), pages 31-40, 2004.
2. Marcelo Arenas and Leonid Libkin. An information-theoretic approach to normal forms for relational and xml data. In PODS,San Diego, CA, USA, 2003.
3. William W. Armstrong. Dependency structures of data base relationships. Proc. IFIP Congress. North Holland, Amsterdam, pages 580-583, 1974.
4. Paolo Atzeni and Valeria De Antonellis. Relational Database Theory. Ed. The Benjamin/Cummings Publishing Company Inc., 1993.
5. C. Beeri and P. A. Bernstein. Computational Problems related to the design of normal form relational schemas. ACM Transactions on Database Systems, 4 (1):30-59, 1979.
6. D. A. Bell. From data properties to evidence. IEEE Transactions on Knowledge and Data Engireering, 5 (6):965-968, 1993.
7. Elisa Bertino, Barbara Catania, and Gian Piero Zarri. Intelligent database systems. Ed. ACM Press. Addison-Wesley, 2001.
8. P. Buneman, S. Davidson, W. Fan, C. Hara, and W. Tan. Reasoning about keys for xml. Draft manuscript, 2000.
9. Nathalie Caspard and Bernard Monjardet. The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey. Discrete Applied Mathematics, 127 (2):241-269, 2003.
10. Edgar F. Codd. A relational model of data for large share data banks. Comm. ACM, 13 (6):377-387, 1970.
11. Pablo Cordero, Manuel Enciso, I. P. de Guzmán, and Angel Mora. SLFD logic: Elimination of data redundancy in knowledge representation. LNAI 2527, Springer-Verlag (IBERAMIA 2002), pages 141-150, 2002.
12. C. Delobel and R.G. Casey. Decomposition of a data base and the theory of boolean switching functions. IBM J. of Research and Development, 17 (5), 1973.
13. Jim Diederich and Jack Milton. New methods and fast algorithms for database normalization. ACM Transactions on Database Systems, 13 (3):339-365, 1988.
14. J. W. Guan and D. A. Bell. Rough computational methods for information systems. Artificial Intelligence, 105 (1):77-103, 1998.
15. Erika Hajnicz. Time structures. Formal description and algorithmic representation. LNAI 1047, Springer-Verlag, 1996.
16. S. Hartmann and S. Link. The implication problem of functional dependencies in complex-value databases. Electronic Notes in Theoretical Computer Science, 123:125-137, 2005.
17. Toshihide Ibaraki, Alexander Kogan, and Kazuhisa Makino. Functional dependencies in Horn Theories. Artificial Intelligence, 108 1-2:1-30, 1999.
18. M. Kirchberg and S. Link. On the implication problem for functional dependencies in the higher-order entity-relationship model. CRPITS'17: Proceedings of the Fourteenth Australasian database conference on Database technologies 2003, pages 115-124, 2003.
19. M. L. Lee, T. W. Ling, and W. L. Low. Designing functional dependencies for xml. LNCS, Springer-Verlag, 2287:124-141, 2002.
20. David Maier. The theory of relational databases. Computer Science Press, 1983.
21. H. Mannila. Methods and problems in data mining. Proceedings of International Conference on Database Theory. Afrati, Kolaitis (ed.), 17 (2), 1997.
22. H. Mannila and K. Raiha. Design of relational databases. Ed. Addison Wesley, Reading, MA, 1992.
23. H. Mannila and K. Raiha. Algorithms for inferring functional dependencies from relations. Data and Knowledge Engineering, 12 (1):83-99, 1994.
24. Angel Mora, Manuel Enciso, Pablo Cordero, Gabriel Aguilera, and I.P.de Guzmán. Closure via functional dependence simplification. Submitted to Acta Informatica, 2005.
25. Angel Mora, Manuel Enciso, Pablo Cordero, and Inmaculada P. de Guzmán. An efficient preprocessing transformation for functional dependencies sets based on the substitution paradigm. LNAI, Springer- Verlag (CAEPIA 2003), 3040, 2004.
26. Jan Paredaens, Paul De Bra, Marc Gyssens, and Dirk Van Van Gucht. The structure of the relational database model. EATCS Monographs on Theoretical Computer Science. Ed. Spring er-Verlag New York, Inc., 1989.
27. William H. Press and et al. Numerical recipes in C. The art of Scientific Computing, ed. Cambridge University Press. 1999.
28. David Robertson and Jaum Agusti. Lightweight uses of logic in conceptual modelling. Software Blueprints. ACM Press. Ed. Addison Wesley, 1999.
29. Bernhard Thalheim. An overview on semantical constraints for database models. 6th International Conference, Intellectual Systems and Computer Science. Moscow, Russia., 1996.
30. Solveig Torgersen. Automatic design of relational databases. Ph. D. Thesis. TR 89-1038. Cornell University, Ithaca, 1989.
31. Jeffrey D. Ullman. Principles of database systems. Computer Science Press, 1982.
32. Lin Lin Wang. Thorough investigations into : An improved algorithm based on subset closures for synthesizing a relational database cheme. IEEE Transactions On Software Engineering, 22 (4):271-274, 1996.
33. Marcel Wild. Computations with finite closure systems and implications. Computing and Combinatorics. LNCS 959. Springer, Berlin-Heidelberg, pages 111-120, 1995.