J. Rissanen, Theory of Joins for Relational Databases - A Tutorial Survey, in: Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 64, , (Springer-Verlag, Berlin, 1979) 537-551. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Corrected 5NF Definition for Relational Database Design - Vincent (1997) (1 citation) (Correct)
....weaker condition than projection join normal form (PJ NF) the other normal form that has been proposed for JDs. 1. INTRODUCTION In the research literature, two normal forms have been proposed for relational database design when the set of dependencies contains arbitrary join dependencies (JDs) [17]. The original, called projection join normal form (PJ NF) 10] was motivated by the database design goal of avoiding update anomalies in a relation and a design satisfies PJ NF if every JD is implied by the set of key functional dependencies (FDs) The second normal 2 form is fifth normal form ....
J. Rissanen, Theory of Joins for Relational Databases - A Tutorial Survey, in: Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 64, , (Springer-Verlag, Berlin, 1979) 537-551.
Recovering a Relation from a Decomposition Using Constraint.. - Jeavons (1993) (Correct)
....and let r i be a relation instance over Y i , for i = 1; q. Let Y = S q i=1 Y i . The join of r 1 ; r q , denoted r 1 1 Delta Delta Delta 1 r q , is the set ft j t is a tuple over Y t[Y i ] 2 r i for i = 1; qg: Finally, we define a join dependency. Definition 2. 4 ([19]) A join dependency over Y is an expression of the form Y 1 1 Delta Delta Delta 1 Y q where Y 1 ; Y q are sets of attributes with Y = S q i=1 Y i . The sets Y 1 ; Y q are called the edges of the join dependency. A relation instance, r, over Y satisfies the join dependency if ....
Rissanen, J. Theory of Joins for Relational Databases - A Tutorial Survey, Proc. 7th Symp. on Math. Found. of Comp. Sci., Lecture Notes in Computer Science 64, Springer-Verlag, (1978), pp. 537--551.
Decomposing Constraint Satisfaction Problems Using.. - Gyssens, Jeavons, Cohen (1994) (24 citations) (Correct)
....In other words, the join operation corresponds precisely to the notion of composition of constraints in a constraint satisfaction problem. This fact has an important consequence which can be expressed using the notion of a join dependency in database theory. Definition 2. 9 A join dependency [28] over Y is an expression Y 1 1 Delta Delta Delta 1 Y k where Y 1 ; Y k are sets of attributes with Y = S k i=1 Y i . The sets Y 1 ; Y k are called the edges of the join dependency. A relation instance r over Y satisfies the join dependency if r = Y 1 (r) 1 Delta Delta ....
Rissanen, J., "Theory of Joins for Relational Databases - A Tutorial Survey," Proceedings of the 7th Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 64, Springer-Verlag, (1978), pp. 537--551.
A Corrected 5nf Definition For Relational Database - Design Millist Vincent (Correct)
No context found.
J. Rissanen, Theory of Joins for Relational Databases - A Tutorial Survey, in: Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 64, , (Springer-Verlag, Berlin, 1979) 537-551.
Semantic Foundations of 4NF - Semantic Foundations Of (Correct)
No context found.
Rissanen, J.: Theory of Joins for Relational Databases - A Tutorial Survey. In: Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 64, pp. 537-551. Berlin: Springer-Verlag 1979
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC