11 search results - page 2 / 3 » A normal form for preventing redundant tuples in relational ... |
ICDE
1992
IEEE
13 years 9 months ago
1992
IEEE
Contrary to popular belief, relation schemes in good classical normal forms are not necessarily devoid of redundancies. This arises from the fact that classical data dependencies ...
HASKELL
2006
ACM
13 years 10 months ago
2006
ACM
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
WWW
2007
ACM
14 years 5 months ago
2007
ACM
Design principles for XML schemas that eliminate redundancies and avoid update anomalies have been studied recently. Several normal forms, generalizing those for relational databa...
ICDE
1993
IEEE
13 years 9 months ago
1993
IEEE
To add time su port to the relational model, both first normal form (fNF and non-INF appmches have maining within 1NF when time support is added may introduce data redundancy. The...
DEXA
2000
Springer
13 years 9 months ago
2000
Springer
The relational model, as proposed by Codd, contained the concept of relations as tables composed of tuples of single valued attributes taken from a domain. In most of the early lit...