Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
An approach for testing the primeness of attributes in relational schemas
Authors: Cotelea Vitalie
Keywords: Relation scheme, functional dependencies, equivalence classes, prime attributes, polynomial complexity tasks
– 0.14 Mb
Keywords: Relation scheme, functional dependencies, equivalence classes, prime attributes, polynomial complexity tasks
Abstract
In this paper there is proposed a method of partition the attributes of relation scheme in equivalence classes and in nonredundant equivalence classes. Several properties of these equivalence classes are proved. Their properties serve as the basis for an algorithm with a polynomial complexity, which determines the prime attributes of a database schema.Academy of Economic Studies of Moldova
Phone: (+373 22) 40 28 87
E-mail:
Phone: (+373 22) 40 28 87
E-mail:
Fulltext
– 0.14 Mb
Contents
- Computer modeling of multidimensional problems of gravitational gas dynamics on multiprocessor computers
- Computational Experiments on the Tikhonov Regularization of the Total Least Squares Problem
- Conceptual issues in development of telemedicine in the Republic of Moldova
- About one algorithm of C2 interpolation using quartic splines
- Postoptimal analysis of one lexicographic combinatorial problem with non-linear criteria
- Structured knowledge management techniques for the development of interactive and adaptive decision support system
- On Covering Approximation Subspaces
- An approach for testing the primeness of attributes in relational schemas
- Ramanujan-like formulas for 1/π2 a la Guillera and Zudilin and Calabi-Yau differential equations
