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

North indian plains, i am not clear with the climetic condition of the nort...

i am not clear with the climetic condition of the north indian plain. can u plz explain it for me

What is meant by the degree of relationship set, What is meant by the degre...

What is meant by the degree of relationship set? The degree of relationship type is the number of participating entity types.

ER-diagram, The State of NewYork certifies firefighters throughout state an...

The State of NewYork certifies firefighters throughout state and keep track all of them, as well as of the state’s fire departments. Each fire department has unique department numb

Draw entity relationship diagram, Draw entity relationship diagram for the ...

Draw entity relationship diagram for the following scenario. A university has many departments whereas each department belongs to that particular uni. That uni has also many bui

Mapping, external and internal mapping with examples

external and internal mapping with examples

Conversion of er diagram to relational database, Conversion of entity sets:...

Conversion of entity sets: I)   For  every  strong  entity  type  E  in  the  ER  diagram,  we  make  a  relation  R containing all the easy attributes of E. The relation R pri

What is secondary index, What is Secondary Index While making the index...

What is Secondary Index While making the index, generally the index table is kept in the primary memory (RAM) and the main table, because of its size is keeps in the secondary

Define rotational latency time, Define rotational latency time. The ti...

Define rotational latency time. The time spent waiting for the sector to be accessed to appear under the head is known as the rotational latency time.

B+ tree, construct a B+ tree for the following set of key value (2,3,5,7,11...

construct a B+ tree for the following set of key value (2,3,5,7,11,19,23,29,31) in ascending order where the pointers that will fit in one node is as follows:A. four B. six C. eigh

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