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

In a hierarchical model of data records are organized, In a Hierarchical mo...

In a Hierarchical model of data records are organized ? In the hierarchical model of data records are organized as Tree structure.

Differentiate between static hashing and dynamic hashing, Differentiate bet...

Differentiate between static hashing and dynamic hashing.  Ans: Static Hashing comprises the number of primary pages in the directory fixed. So, while a bucket is full, we requ

How are tables stored on disk?, How are tables stored on Disk? We reali...

How are tables stored on Disk? We realise that every record of a table can have different amounts of data. This is due to in some records; some attribute values may be "zero".

Explain the b+ tree, Explain the B + tree? B + tree is a type of tre...

Explain the B + tree? B + tree is a type of tree which denotes sorted data in a way that permits for efficient insertion, retrieval and removal of records, each of which is

Enterprise applications integration, The figure below depicts the conceptu...

The figure below depicts the conceptual diagram of a banking system. (a) Describe one example relevant to the system in figure, for each of the 4 types of enterprise appl

What is 2nf, What is 2NF? A relation schema R is in 2NF if it is in 1NF...

What is 2NF? A relation schema R is in 2NF if it is in 1NF and every non-prime attribute A in R is fully functionally dependent on primary key.

Concurrent transactions-backup and recovery, Representing complex relations...

Representing complex relationship among data A database may contain varieties of data interrelated to each other in numerous ways. A DBMS must have the capability to represent

Why is database redesign necessary, Why is database redesign necessary? ...

Why is database redesign necessary? Database redesign is essential for two reasons. First, redesign is essential both to fix mistakes made during the initial database design. S

Implementation of database, The ER diagram clearly showing the additional t...

The ER diagram clearly showing the additional tables you have implemented. SQL table creation scripts for the tables you have set up. SQL scripts showing the sample data you

Define the categories of sql statements, Define the categories of SQL State...

Define the categories of SQL Statements? 1) Statements that don't return a result set. This statement class includes INSERT, DELETE, and UPDATE. 2)Statements that return

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