An Efficient Preprocessing Transformation for Functional Dependencies Sets Based on the Substitution Paradigm

Mora, Ángel; Enciso, Manuel; Guzmán, Inman P. de

doi:10.1007/978-3-540-25945-9_14

Cited by 15 publications

(10 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…SL FD has allowed the design of efficient automated methods: in (Mora et al, 2004) an automated method to remove redundancy was developed, (Mora et al, 2012) introduces an efficient algorithm based directly on SL FD to compute the closure of a set of attributes and finally in (Cordero et al, 2013) a novel algorithm to find all minimal keys based on SL FD has been presented.…”

Section: Simplification Logicmentioning

confidence: 99%

Quality Improvement in Data Models with SLFD-based OCL Constraints

Baena¹,

Aragón²,

Enciso

et al. 2013

Proceedings of the 8th International Joint Conference on Software Technologies

View full text Add to dashboard Cite

Software verification and modeling quality are permanent challenges in software development. So, smarter and more cohesive methods for the creation and maintenance of data models without loss of quality are required as model complexity increases in current academic and industrial MDE-based system designs. In-place endogenous model transformations (refactorings) are an efficient and straightforward approach to deal with data model complexity, but ad-hoc and frequent transformations must be performed to maintain model quality. In this paper we explore an alternative method to ensure the quality of data models: correction by contract. We propose a new method for the creation and maintenance of static data models (relational, entity-relationship or class models) with enhanced quality. We will use an executable logic for functional dependencies to characterize data model redundancy and we define a set of OCL constraints to guide the construction and maintenance of the models. We also illustrate this approach with a simplified intermediate metamodel (FDMM) for functional dependencies over a data model to show the potential benefits of the method.

show abstract

Section: Simplification Logicmentioning

confidence: 99%

Quality Improvement in Data Models with SLFD-based OCL Constraints

Baena¹,

Aragón²,

Enciso

et al. 2013

Proceedings of the 8th International Joint Conference on Software Technologies

View full text Add to dashboard Cite

show abstract

“…• In (Cordero et al, 2002;Mora et al, 2003) the simplification rule is directly used to design a couple of transformations which reduce the redundancy in the functional dependencies set looking for a more optimal specification. These transformations are similar to the normalization process.…”

Section: Icsoft2012-7thinternationalconferenceonsoftwareparadigmtrendsmentioning

confidence: 99%

A Metamodel for Functional Dependencies - Towards a Functional Dependency Model Transformation

Enciso¹,

Rossi²,

Guevara³

2012

Proceedings of the 7th International Conference on Software Paradigm Trends

View full text Add to dashboard Cite

Model driven engineering has been shown to be a useful framework to enrich the quality of software. Metamodeling and model transformation have opened the door to specifying data models and manage it in a formal and solid way. These favourable features are particularly welcome in collaborative development, where we need a data model suitable for specifying information from different sources, and which can also facilitate the integration of this heterogeneous information to a global data model. In this paper we introduce a metamodel based on the notion of functional dependencies and we propose to use model driven engineering for the development of model transformation based on the SLFD logic.

show abstract

“…In [33] we show a pre-processing transformation that prunes a set of FDs in an automatic way. In [1] we have illustrated the difficulties of tackling the implication problem with a method directly based on FDs logic and we have introduced the notion of atomic-minimality, which guides the treatment of sets of FDs in a rewriting logic.…”

Section: Conclusion and Current Workmentioning

confidence: 99%

Non-deterministic ideal operators: An adequate tool for formalization in Data Bases

Mora

Guzmán

Enciso

2008

Discrete Applied Mathematics

View full text Add to dashboard Cite

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).

show abstract

An Efficient Preprocessing Transformation for Functional Dependencies Sets Based on the Substitution Paradigm

Cited by 15 publications

References 15 publications

Quality Improvement in Data Models with SLFD-based OCL Constraints

Quality Improvement in Data Models with SLFD-based OCL Constraints

A Metamodel for Functional Dependencies - Towards a Functional Dependency Model Transformation

Non-deterministic ideal operators: An adequate tool for formalization in Data Bases

Contact Info

Product

Resources

About