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 meant by data-transfer rate, What is meant by data-transfer rate? ...

What is meant by data-transfer rate? The data-transfer rate is the rate at which data can be retrieved from or kept to the disk.

Fragmentation, Differentiate between horizontal & mixed horizontal fragment...

Differentiate between horizontal & mixed horizontal fragmentation?

Advanced database systems, Consider an information system designed for an o...

Consider an information system designed for an online company which provides IT products and services These include desktops, laptops, networking products, IT books, parts, and

What is omr, What is OMR? OMR (Optical Mark Recognition) is the transla...

What is OMR? OMR (Optical Mark Recognition) is the translation of marks - or the absence of marks - but not the shape of the mark on forms that have small circles ("also called

What is asterisk in sql, What is Asterisk in SQL? Asterisk (*): In SQL,...

What is Asterisk in SQL? Asterisk (*): In SQL, the columns for all the tables and views in the FROM clause will be displayed.

Define atom of domain relational calculus, Define Atom of domain relational...

Define Atom of domain relational calculus An atom has the outline 1 , x 2 , ... , x n > -> r , in which r stands for a relation on n attributes and x 1 , x 2 , ... , x n ar

Define decision tree classifiers, Define decision tree classifiers? As ...

Define decision tree classifiers? As the name suggests decision tree classifiers use a tree: Every leaf node has an associated class, and every internal node has a predicate as

What is the candidate key for a table with columns, For problems 1-4, give ...

For problems 1-4, give all candidate keys for the tables with FDs specified.  Composite candidate keys must be put in parentheses, and candidate keys must be separated with commas

Explain the concept of data mining, Question 1 Explain the concept of Fore...

Question 1 Explain the concept of Foreign Key. How a foreign key differs from a Primary Key? Can the Foreign Key accept nulls? Question 2 With a necessary example explain (i)

Represent the form as a relational schema, Question: This form represen...

Question: This form represents one of a number used for each sailing of a range of boats. A passenger may go on many sailings and will have the same passenger number for each.

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