Division operation, Database Management System

To do the division operation R1 ÷ R2, R2 should be a correct subset of R1. In the following example R1 have attributes A and B and R2 have only attribute B so R2 is a correct subset of R1. If we perform R1 ÷ R2 than the resultant relation will have those values of A from R1 that are related to all values of B present in R2.

Example

A

B

A1

B1

A1

B2

A2

B1

A3

B1

A4

B2

A5

B1

A3

B2

Let R1

If R2                    R3= R1 ÷ R2                      If R2                       R3= R1 ÷ R2

180_DIVISION operation.png

If R2                  R3= R1 ÷ R2                                               If R2             R3= R1 ÷ R2

1567_DIVISION operation1.png

Figure:  The Division Operation

Note:

               Degree of relation: Degree (R ÷ S)=Degree of R - Degree of S.

Posted Date: 3/6/2013 5:57:47 AM | Location : United States







Related Discussions:- Division operation, Assignment Help, Ask Question on Division operation, Get Answer, Expert's Help, Division operation Discussions

Write discussion on Division operation
Your posts are moderated
Related Questions
how to write a in a text and load it on mysql

Insulation between conceptual and physical structures It can be defined as: 1. The Database Administrator should be capable to vary the storage structures without affectin

Question (a) Visual Basic is governed by an event processor. Explain the meaning of this phrase. (b) Differentiate between an general procedure and event procedure. (c)

Compare the Nested-loop join and block-nested loop join Ans: Nested  loop join - It is costly as worst case cost, no. of block accesses needed is n r * b s + b r   where b

A file of employee have 10,000 blocks on a cylinder of a disk with characteristics r=8ms and btt=0.6ms I want to know the cost of read inthe file under following conditions for a q

What is the difference between WHERE and HAVING clauses?. Predicates in the WHERE clause applies to every tuple while the predicate in the HAVING clause applies to groups.

a. Define the term "deadlock". There are four conditions that must hold before deadlock is possible. Name them. b. Outline an algorithm that detects whether there is a deadlock.

(a) Explain the three types of potential mistake which could occur if concurrency control is not properly enforced in the database system. Support your answer with appropriate ex

What is magnetic disks?explain it? Magnetic disk provides the bulk of secondary storage of modern computer system. The disk capacity is growing at over 50% per year. But the st

Explain Transaction manager and their work? Transaction Manager: Ensure the database remains in a constant (correct) state despite system failure, and in which concurrent trans