Vertical fragmentation, Database Management System

Assignment Help:

Vertical Fragmentation-Vertical fragmentation groups together only those attributes in a relation that are used jointly by various important transactions. A vertical fragment is described using the Projection operation of the relational algebra. In its most easy form, vertical fragmentation is the similar as that of decomposition. In common, a relation can be constructed on taking Natural join of all vertical fragments.

More usually, vertical fragmentation is accomplished by adding a special attribute known as a tuple-number to the scheme R. A tuple-number is a logical or physical address for a tuple. Therefore every tuple in R must have a unique address, the tuple- number attribute is a key to the new fragments get (please refer to Figure ).

Branch-code

Account number

Customer name

Balance

Tuple-number

1101

3050

Suresh

5000

1

1101

2260

Swami

3360

2

1102

1170

Swami

2050

3

1102

4020

Khan

10000

4

1101

1550

Khan

620

5

1102

4080

Khan

1123

6

1102

6390

Khan

7500

7

                                      Figure: The relation DEPOSIT of figure 5 with tuple- numbers

This  relation  now  can  be  decayed  into  two  fragments  as:  demonstrates  a  vertical decomposition of the scheme Deposit-scheme tuple number into:

DEPOSIT3 =  (branch-code. customer-name, tuple-number) (DEPOSIT)

DEPOSIT4 = ∏  (account-number, balance, tuple-number) (DEPOSIT)

The example of above Figure on this basis would become:

DEPOSIT3

Branch-code

Customer-name

Tuple-number

1101

Suresh

1

1101

Swami

2

1102

Swami

3

1102

Khan

4

1101

Khan

5

1102

Khan

6

1102

Khan

7

DEPOSIT4

Account number

Balance

Tuple-number

3050

5000

1

2260

3360

2

1170

2050

3

4020

10000

4

1550

620

5

4080

1123

6

6390

7500

7

                                                     Figure: Vertical fragmentation of relation DEPOSIT

How can we rebuild the original relation from these 2 fragments? By taking natural join of the 2 vertical fragments on tuple-number. The tuple number permits direct retrieval of the tuples without the required for an index. Therefore, this natural join may be computed much extra efficiently than typical natural join.Though, please note that as the tuple numbers are system generated, thus they should not be visible to common users. If users are given access to tuple-number, it happens to impossible for the system to change tuple addresses.

 


Related Discussions:- Vertical fragmentation

Example of relational operations, Consider the relation PERSON. If you want...

Consider the relation PERSON. If you want to display details of persons having age less than or equal to 30 than the select operation will be used as follows: σ AGE The resu

Remove all transitive dependencies - dependency diagram, 1. Use the Invoice...

1. Use the Invoice table structure shown below to answer the following questions: a)  Draw the dependency diagram and identify the primary key and all dependencies, including al

Discuss the three level architecture of dbms, PRINCIPLES OF DATABASE 1....

PRINCIPLES OF DATABASE 1. State the following terms: a) Database b) Database Management System c) Entity d) Attribute e) Relationship 2. Discuss the Three Level Architecture

Advantages and disadvantages of using a database system, What are the advan...

What are the advantages and disadvantages of using a database system. Sol. Advantages of Database System (DBMS) :  (1) Data Redundancy and Inconsistency: Since differen

Student, explain exhausitively the problems associated with er diagrams wit...

explain exhausitively the problems associated with er diagrams with ellustrations

Ans the following, discuss the array implementation of a stack.

discuss the array implementation of a stack.

What are the types of reference, What are the types of reference?explain it...

What are the types of reference?explain it with suitable examples? Object oriented language given the ability to refer the object attribute of the type can be referred to the s

Sql, sql is relationally complete-justify

sql is relationally complete-justify

Determine the object-oriented design process, An object-oriented design pro...

An object-oriented design process  1. Define the context and modes 2. Designs the system architecture 3. Identifies the principal system objects 4. Identifies concurrency in

Explain deadlock detection and recovery, Explain Deadlock detection and rec...

Explain Deadlock detection and recovery Deadlock Detection - A deadlock is said to take place when there is a circular chain of transaction, every waiting for the release of 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