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

What is normalization, What is normalization? It is a method of analysi...

What is normalization? It is a method of analysing the given relation schemas based on their Functional Dependencies (FDs) and primary key to attain the properties (1).Minim

Two phase locking (2pl), Two Phase Locking (2PL) The two-phase locking ...

Two Phase Locking (2PL) The two-phase locking protocol having of two phases: Phase 1 : The lock acquisition phase : If a transaction T needs to read an object, it wants to

ERD, entity relationship diagram about finance

entity relationship diagram about finance

Spanned and unspanned organisation, Spanned and unspanned organisation? ...

Spanned and unspanned organisation? Spanned and unspanned organization: If records are not permited to cross block boundaries then the organisation is called unspanned record

What are advantages of object-oriented programming paradigm, What is the ma...

What is the major advantage of object-oriented programming paradigm? The ability to modify the explanation of an object without affecting the rest of the system is the main adv

Identify the candidate keys, Consider the following six relation schemes an...

Consider the following six relation schemes and their corresponding sets of functional dependencies. In each case identify a. All the candidate keys b. The highest normal for

Conversion of er diagram to relational database, Conversion of entity sets:...

Conversion of entity sets: I)   For  every  strong  entity  type  E  in  the  ER  diagram,  we  make  a  relation  R containing all the easy attributes of E. The relation R pri

Column constraints, Column Constraints: NOT NULL, UNIQUE, CHECK, PRIMARY K...

Column Constraints: NOT NULL, UNIQUE, CHECK, PRIMARY KEY, DEFAULT, REFERENCES, On  delete  Cascade :  Using  this  key  whenever  a  parent  row  is  removed  in  a referenced

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

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

Illustrate the state model for the atm class, Illustrate the State model fo...

Illustrate the State model for the ATM class let us take state model for the ATM class given below in Figure showing state model of the ATM class and the pseudo code derived fr

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