| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 899 2 |
| Ultima descărcare din IBN: 2022-01-29 18:41 |
| Căutarea după subiecte similare conform CZU |
| 004.65:519.1 (1) |
| Date (108) |
| Analiză combinatorică. Teoria grafurilor (114) |
 SM ISO690:2012COTELEA, Vitalie. An approach for testing the primeness of
attributes in relational schemas. In: Computer Science Journal of Moldova, 2009, nr. 1(49), pp. 89-99. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Computer Science Journal of Moldova |
||||||
| Numărul 1(49) / 2009 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 004.65:519.1 | ||||||
| Pag. 89-99 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
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. |
||||||
| Cuvinte-cheie Relation scheme, functional dependencies, equivalence classes, prime attributes, polynomial complexity tasks. |
||||||
|
|
|
|
