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

Wound-wait scheme-deadlock prevention, " Wound-wait" scheme : It is based o...

" Wound-wait" scheme : It is based on a preemptive method. It is based on a simple rule:                   If Ti requests a database resource that is held by Tj

Stock market, need requirement analysis for database management of stock ma...

need requirement analysis for database management of stock market

Determine the programming language structures, What is the most significant...

What is the most significant feature that does not directly map into programming language structures? Why? Association, since there are complex types of association, like as qu

What are the reasons of bucket overflow, What are the reasons of bucket ove...

What are the reasons of bucket overflow? Explain any two methods for solving this problem. Ans:  It is general for file structures to be divided into equal-length partitions, k

Create a e-r diagram, Information about films holds information about movie...

Information about films holds information about movies, stars and studios. Movies have a title, year of production, length and the film type. Stars have a name and address. Studi

Explain the ansi sparc architecture, Explain the ANSI SPARC architecture ...

Explain the ANSI SPARC architecture The three-schema architecture is as well known as ANSI SPARC architecture. The aim of the three-schema architecture is to separate the user

Where and having clause in sql, WHERE and HAVING clause in SQL ? The WH...

WHERE and HAVING clause in SQL ? The WHERE clause is commonly used for implementing conditions on each tuple of the relation. The HAVING clause is used in combination along wi

Database errors, Database Errors: An error is said to have occurred if the ...

Database Errors: An error is said to have occurred if the implementation of a command to manipulate the database cannot be successfully finished either due to inconsistent data or

Define deadlock prevention, Define deadlock prevention. Deadlock preven...

Define deadlock prevention. Deadlock prevention is a set of methods for ensuring that at least one of the four essential conditions like mutual exclusion, hold and wait, no pre

Entity set that does not have sufficient attributes known as, An entity set...

An entity set that does not have sufficient attributes to form a primary key is called? An entity set that doesn't have sufficient attribute to form a primary key is known as w

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