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

Give an example of enforcement in typing, Give an example of enforcement in...

Give an example of enforcement in Typing. You can understand the idea of enforcement as it makes sure objects of dissimilar classes may not be interchanged as below:  Exampl

A basic model of database access control, A basic model of Database Access ...

A basic model of Database Access Control Models of database access control have grown out of previous work on protection in operating systems. Let us talk about one simple mode

What is data model, A Data Model in software engineering is an abstract...

A Data Model in software engineering is an abstract model that organizes and documents the business data for interaction between team members and is used as a plan for creating

What are the storage types, What are the storage types? The storage typ...

What are the storage types? The storage types are: a) Volatile storage b) Nonvolatile storage

Explain what is rdbms, Explain what is RDBMS ? RDBMS - RDBMS is a datab...

Explain what is RDBMS ? RDBMS - RDBMS is a database management system (DBMS) which stores data within the form of relations. Relational databases are powerful since they need f

What are the technique to define a schema completely, What are the techniqu...

What are the technique to define a schema completely ? A schema is completely define by DDL and DML query language.

What is rdbms terminology for a row, What is RDBMS terminology for a row? ...

What is RDBMS terminology for a row? A tuple is a RDBMS terminology for a row

Explain b-tree, What is B-Tree? A B-tree eliminates the redundant stora...

What is B-Tree? A B-tree eliminates the redundant storage of search-key values .It permits search key values to appear only once.

Describe embedded query language, Describe Embedded Query Language? Emb...

Describe Embedded Query Language? Embedded Query Language - A query language (e.g., SQL) can be implemented in two ways. It can be used interactively or embedded within a host

FIELDS, 4. Describe three ways to handle missing field values

4. Describe three ways to handle missing field values

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