Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Some results about functional dependencies
Acta Cybernetica
The relational model for database management: version 2
The relational model for database management: version 2
Functional dependencies in relational databases: a lattice point of view
Discrete Applied Mathematics - Special issue on combinatorial problems in databases
Relational database theory
Algorithms for inferring functional dependencies from relations
Data & Knowledge Engineering
Some results about normal forms for functional dependency in the relational datamodel
Discrete Applied Mathematics
Rough computational methods for information systems
Artificial Intelligence
Constraints for semistructured data and XML
ACM SIGMOD Record
On XML integrity constraints in the presence of DTDs
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Functional and embedded dependency inference: a data mining point of view
Information Systems - Special issue on Databases: creation, management and utilization
From Data Properties to Evidence
IEEE Transactions on Knowledge and Data Engineering
Designing Functional Dependencies for XML
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Methods and Problems in Data Mining
ICDT '97 Proceedings of the 6th International Conference on Database Theory
SLFD Logic: Elimination of Data Redundancy in Knowledge Representation
IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Discrete Applied Mathematics - Special issue: The 1998 conference on ordinal and symbolic data analysis (OSDA '98)
A New Algebraic Tool for Automatic Theorem Provers
Annals of Mathematics and Artificial Intelligence
Database dependency discovery: a machine learning approach
AI Communications
A coalgebraic approach to non-determinism: Applications to multilattices
Information Sciences: an International Journal
| Hi-index | 0.04 |
In this paper, we propose the application of formal methods to Software Engineering. The most used data model is the relational model and we present, within the general framework of lattice theory, this analysis of functional dependencies. For this reason, we characterize the concept of f-family by means of a new concept which we call non-deterministic ideal operator (nd.ideal-o). The study of nd.ideal-o.s allows us to obtain results about functional dependencies as trivial particularizations, to clarify the semantics of the functional dependencies and to progress in their efficient use, and to extend the concept of schema. Moreover, the algebraic characterization of the concept of Key of a schema allows us to propose new formal definitions in the lattice framework for classical normal forms in relation schemata. We give a formal definition of the normal forms for functional dependencies more frequently used in the bibliography: the second normal form (2FN), the third normal form(3FN) and Boyce-Codd's normal form (FNBC).