Explain the cartesian product, Database Management System

Assignment Help:

Explain the Cartesian product: 

The Cartesian product operation does not need relations to union-compatible.  The meaning of this is that the involved relations may have dissimilar schemas.  Let R & S be relations that may have dissimilar schemas. 

 DEF: Cartesian product

 The Cartesian product of relations R and S, denoted R X S, is the set of all probable combinations of tuples of the two operation relations.  Every resultant tuple contains all the attributes of R and S. 

The resultant relation has  

 Cardinality = (cardinality of R) * (cardinality of S); and 

 arity = (arity of R)  +  (arity of S). 

 For instance, in given table, STUDENT X MODULE is equal to

1560_Cartesian Product.png


Related Discussions:- Explain the cartesian product

Which language has recently become the defacto standard, Which language has...

Which language has presently become the defacto standard for interfacing application programs along with relational database system? The language which has recently become the

Write short notes on transaction state, Write short notes on transaction st...

Write short notes on transaction state? A transaction may not always complete its implementation successfully such a transaction is termed aborted A transaction must be in o

Search the salary of employees who are not ‘analyst’ , Example- Search the ...

Example- Search the salary of employees who are not 'ANALYST' but get a salary below than or equal to any people employed as 'ANALYST'. SELECT EMPNO, ENAME, JOB, SAL FROMEMP

Relation schema for student, Example RELATION SCHEMA for STUDENT: STU...

Example RELATION SCHEMA for STUDENT: STUDENT (Roll No: string, name: string, login: string, age: integer) RELATION INSTANCE

Define tuple variable, Define tuple variable Tuple variable is a type o...

Define tuple variable Tuple variable is a type of variable whose domain is the set of all tuples.

Define the boyce-codd normal form, Define the Boyce-Codd Normal Form with i...

Define the Boyce-Codd Normal Form with instance and also Compare BCNF and 3NF.  Ans: BCNF: For each functional dependency X->Y in a set F of functional dependencies over relati

Transactions t1 and t2 are in a deadlock, Evaluate: a.When transactions...

Evaluate: a.When transactions T1 and T2 are in a deadlock, one of the transactions will eventually implement to completion and let the other one continue implementation. b.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd