Generalized dependencies in relational databases
A new type of dependencies in a relational database model introduced in [5] is investigated. If b is an attribute, A is a set of attributes then it is said that b (p, g, )-depends on A, in notation A ^^ b, in a database relation r if there are no q + 1 tuples in r such that they have at most p diffe...
Elmentve itt :
| Szerző: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1998
|
| Sorozat: | Acta cybernetica
13 No. 4 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12602 |
| LEADER | 01366nab a2200229 i 4500 | ||
|---|---|---|---|
| 001 | acta12602 | ||
| 005 | 20220613155244.0 | ||
| 008 | 161015s1998 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Sali Attila | |
| 245 | 1 | 0 | |a Generalized dependencies in relational databases |h [elektronikus dokumentum] / |c id. Sali Attila |
| 260 | |c 1998 | ||
| 300 | |a 431-438 | ||
| 490 | 0 | |a Acta cybernetica |v 13 No. 4 | |
| 520 | 3 | |a A new type of dependencies in a relational database model introduced in [5] is investigated. If b is an attribute, A is a set of attributes then it is said that b (p, g, )-depends on A, in notation A ^^ b, in a database relation r if there are no q + 1 tuples in r such that they have at most p different values in each column of A, but 9 + 1 different values in 6. (1, l)-dependency is the classical functional dependency. Let ¿7{A) denote the set {b: A 6}. The set function J\ 2n —> 2 n becomes a closure if p = q. Results on representability of closures by (p, p)-dependencies are presented. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika | ||
| 700 | 0 | 1 | |a Sali Attila |e aut |
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12602/1/cybernetica_013_numb_004_431-438.pdf |z Dokumentum-elérés |