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 data defination language, What is DDL? Make a list of commands with...

What is DDL? Make a list of commands with short description used in DDL Ans: Data Definition Language that is abbreviated as DDL is a computer language for defining data struct

Perform an exploratory analysis on the entire dataset, Australian Bureau of...

Australian Bureau of Statistics (ABS) provides retail data for different groups and different states as well as the aggregate numbers. Table 11 " Retail Turnover, State by Industry

Objectives-database recovery and security, Objectives Define the te...

Objectives Define the terms RECOVERY and INTEGRITY; Define Recovery Techniques; Explain Error and Error detection techniques, and Define types of Authorisation.

Determine the derived attribute to avoid re-computation, Determine the Deri...

Determine the Derived attribute to avoid re-computation Each class box consists of an ordered list of attributes and operations, each represented as a next string. We can find

Log, what is the need of a log in dbms

what is the need of a log in dbms

Explain pipelining, Explain pipelining.        Ans: In order to describ...

Explain pipelining.        Ans: In order to describe pipelining in simple terms, think of it as breaking down processor functions into smaller and smaller parts. For instance,

How to apply the bcnf decomposition , Consider the following relational sch...

Consider the following relational scheme: R (a,b,c,d,e,f) and its corresponding set of FDs {d→ a, be → c, ac → e, b → f, f → d, a → c}. a. Is the following decomposition i) non

Eliminate columns not dependent on key, Eliminate Columns Not Dependent On ...

Eliminate Columns Not Dependent On Key The Employee Relation satisfies - First normal form - As it has no repeating groups. Second normal form - As it do not have multi-a

Er diagram, Draw an ER diagram for company''s database schema

Draw an ER diagram for company''s database schema

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