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 strict two-phase locking, Explain Strict Two-Phase locking A tr...

Explain Strict Two-Phase locking A transaction T does not release any type of its exclusive (X) locks until that transaction commits or aborts. In this method no other transact

Explain optimistic locking and pessimistic locking, Explain the difference ...

Explain the difference between optimistic locking and pessimistic locking. Optimistic locking supposes no transaction conflict will occur and deals with the consequences if it

Each statement should have a where clause, Submit SQL SELECT Statements to ...

Submit SQL SELECT Statements to demonstrate several reports off your database, according to the following guidelines: You must submit at least 5 SELECT Statements. Each

What is odbc, What is ODBC ? ODBC - Open DataBase Connectivity which i...

What is ODBC ? ODBC - Open DataBase Connectivity which is also denoted by ODBC enable the integration of SQL along with a common-purpose programming language. ODBC expose data

Tables, does tables are called relations

does tables are called relations

Explain the term- periodic recomputation, Explain the term- Periodic recomp...

Explain the term- Periodic recomputation Periodic recomputation:  Base values are often updated in bunches. Sometimes, it is possible to just recompute all derived attributes p

Explain candidate key, Explain Candidate key? Candidate Key - A candi...

Explain Candidate key? Candidate Key - A candidate key is a minimal superkey, that can be used to uniquely identify a tuple in the relation.

Record based logical models, Record based Logical Models: Use records as th...

Record based Logical Models: Use records as the key data representation components Examples: Relational Model: It shows data as well as relationship between data in the form

What three major types of actions includes databases, What three major type...

What three major types of actions includes databases? Briefly discuss these The three major types of actions including databases are: (i) Defining: It includes specifyin

Modular growth, Modular growth: In distributed environments, it is simple t...

Modular growth: In distributed environments, it is simple to expand. Latest sites can be added to the network without affecting the operations of other sites, as they are somewhat

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