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

Explain the structure of well formed formulae, Explain the structure of wel...

Explain the structure of well formed formulae in relational calculus. Ans: a. An atom is a formula b. If P1 is a formula, after that so are ¬P1 and (P1) c. If P1 and P2 a

Using literal character string-data manipulation language, Using Literal Ch...

Using Literal Character String Example: To print IS A as one string with column name employee SELECT ENAME || ' IS A ' || JOB AS "EMPLOYEE" FROM EMP;

Example for while until, Assume you are given a uniprocessor system with on...

Assume you are given a uniprocessor system with one gigabyte of memory and a 300 gigabyte disk. The OS on the machine has a demand paged virtual memory system with a local page rep

Briefly describe the different kinds of users of a dbms, Briefly describe t...

Briefly describe the different kinds of users of a DBMS.  Ans: Different sorts of DBMS users are: (a)  Software Engineers: These are the people accountable for developing ap

What is a b+-tree index, What is a B+-Tree index? A B+-Tree index takes...

What is a B+-Tree index? A B+-Tree index takes the form of a balanced tree in which each path from the root of the root of the root of the tree to a leaf of the tree is of the

Define a relation in dbms, Define a relation ? Relation - A relations...

Define a relation ? Relation - A relations is a named two-dimensional table of data. Mathematically, a relation can be described as a subset of the cartesian product of a lis

What is bankers algorithm, What is banker's algorithm?  Banker's algori...

What is banker's algorithm?  Banker's algorithm is a deadlock avoidance algorithm that is applicable to a resource-allocation system with multiple instances of each resource ty

Properties of a transaction , Properties of a Transaction        A tra...

Properties of a Transaction        A transaction has four main properties. These are: Atomicity Consistency Isolation or Independence Durability or Permanen

4, explain the level architectures of the database management system

explain the level architectures of the database management system

Explain the term- signal-to-noise ratio, Explain the term- signal-to-noise ...

Explain the term- signal-to-noise ratio A signal-to-noise ratio of 20 dB means that S/N = 100. As log2101 is around 6.658, the Shannon limit is around 19.975 kbps. The Nyquist

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