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

Which are two ways that entities participate relationship, Which are the tw...

Which are the two ways in which entities can participate in a relationship? Total and partial are the two ways in which entities can participate in a relationship

Write short note on events, Write short note on Events Events consist ...

Write short note on Events Events consist of inputs, interrupts, decisions and actions performed by any external device or users. Every event always has a sender and receiver.

Data files indices and data dictionary, The indices are accumulated in the ...

The indices are accumulated in the index files. The data is accumulated in the data files. Indices give fast access to data items. For example, a book database may be managed in th

Explain the use of constraints in functional model, Explain the use of cons...

Explain the use of constraints in functional model with suitable example. A constraint shows relationship between two objects at same time, or   among various values of the sam

Describe second normal and third normal form, Database Management Systems ...

Database Management Systems 1. Explain SQL Server 2000 Architecture with diagram. 2. Describe Second Normal and Third Normal Form. 3. Explain about query engine and stora

Assignment topic, assume we have the following apllicationthat model sccer ...

assume we have the following apllicationthat model sccer team the games they play and the players inv each teamin the design we want to capture

Define the terms- ddl and dml, Define the terms   i) DDL   ...

Define the terms   i) DDL   ii) DML   DDL: Data base schema is specified by a set of definitions expressed by a special   language known as a data def

What is indexed sequential file organization, What is indexed sequential fi...

What is indexed sequential file organization? What are the applications of this organization?  Ans: An index file can be employed to effectively overcome the problem of storing

An Apriori algorithm, Submission Requirements All answers must be co...

Submission Requirements All answers must be computer generated (including text and diagrams). The hand-in version must include a header page (or with sufficient space)

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