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 method is used to key transformation, Which method is used to key tra...

Which method is used to key transformation ? A hash method is used to key transformation.

Write a short note on temporary tables, Write A short note on temporary tab...

Write A short note on temporary tables? Temporary Tables - Temporary tables exists solely for a particular session, or whose data persists for the duration of the transaction

What three major types of actions includes databases, What three major type...

What three major types of actions includes databases? Briefly discuss these The three major types of actions including databases are: (i) Defining: It includes specifyin

What type of view of total database content, What type of view of total dat...

What type of view of total database content? Data base content Conceptual view of total database contain.

Differentiate between primary and secondary storage, Differentiate between ...

Differentiate between Primary and secondary storage? Primary and secondary storage - Primary storage device stores the data temporarily. Primary storage is commonly used thro

Differentiate between b-tree and b+ tree, Differentiate between B-tree and ...

Differentiate between B-tree and B + tree    Ans:  A B-tree (or Balanced Tree) is a search tree along with additional constraints that makes sure that the tree is all the time

Draw the precedence graph, Draw the precedence graph of the following sched...

Draw the precedence graph of the following schedule and determine whether the schedule is serializable. (Note that all instructions, except lock and unlock, are omitted. We assume

Online examination system project, entity relationship diagram for online e...

entity relationship diagram for online examination system

Oracle RDBMS, compare the features of oracle RDBMS with MySQL and Microsoft...

compare the features of oracle RDBMS with MySQL and Microsoft SQL server

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