Cartesian product, Database Management System

Assignment Help:

If R1 and R2 are two relations or functions, then the result of R3 = R1 × R2 is the combination of tuples that are in R1 and R2. The product is associative and commutative.

Degree (R3) =Degree of (R1) + Degree (R2).

In case, R3 will have tuples such that R3 = {t1 || t2 | R1 ∋ t1  ∧ R2 ∋ t2}.

Example:

R2

A

B

A1

B1

A2

B2

A3

B3

A4

B4

 

 

       R1                         

C

C1

C2

 
       

R3 = R1 × R2 is

 

A

B

C

A1

B1

C1

A1

B1

C2

A2

B2

C1

A2

B2

C2

A3

B3

C1

A3

B3

C2

A4

B4

C1

A4

B4

C2

 


Related Discussions:- Cartesian product

Define 1 nf normal form, 1 NF Normal Form The domain of attribute must...

1 NF Normal Form The domain of attribute must add only atomic (simple, indivisible) values First normal form (Minimal Form or 1NF) is a normal form need in database normalizat

Describe the algorithm for updating indices, Describe the algorithm for upd...

Describe the algorithm for updating indices for a single level index when a record is    (i) Inserted  (ii)  deleted What will be the modification if there are multilevel in

Explain record based logical models, Explain Record Based Logical Models? ...

Explain Record Based Logical Models? Record-Based logical Models: Also define data at the conceptual and view levels. Unlike object-oriented models, are used to state overall

ENTITY DIAGRAMS IN FIRST NORMAL FORM, CAN SOMEONE HELP ME WITH ENTITY DIAGR...

CAN SOMEONE HELP ME WITH ENTITY DIAGRAMS IN FIRST NORMAL FORM?

Identify the candidate keys, Consider the following six relation schemes an...

Consider the following six relation schemes and their corresponding sets of functional dependencies. In each case identify a. All the candidate keys b. The highest normal for

What is a candidate key, What is a candidate key? Minimal super keys ar...

What is a candidate key? Minimal super keys are known as candidate keys.

Define deadlock prevention, Define Deadlock prevention These protocols...

Define Deadlock prevention These protocols make sure that the system will never enter a deadlock state. There are two methods to deadlock prevention. One approach makes sure t

Ideal data dictionary, An ideal data dictionary should have everything a DB...

An ideal data dictionary should have everything a DBA wants to know about the database. 1 Conceptual, External, and internal database descriptions. 2.    Descriptions of attr

Explain what is aggregation, Explain what is Aggregation ? Aggregation...

Explain what is Aggregation ? Aggregation: This is used whenever we intend to show a relationship between an entity and the relationship. There is no provision for this in th

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

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