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

Differance between ddl and sdl, Differance between DDL and SDL? DDL and...

Differance between DDL and SDL? DDL and SDL - The data definition language (DDL) is used through DBA and database designers to describe internal schema, conceptual schema, and

Hashing techniques, folding method and mid square method using visual basic...

folding method and mid square method using visual basic

Implementation of association as an object, Implementation of association a...

Implementation of association as an object Implement as a separate association object, independent of either class, as in Figure. An association object is a group of pairs

What is called a query evaluation plan, What is called a query evaluation p...

What is called a query evaluation plan? A sequence of primitive operations that can be used to assess a query is a query evaluation plan or a query implementation plan.

Define views in relational algebra, Views in relational algebra:   1. B...

Views in relational algebra:   1. Basic expression contains either  a) A relation in the database. b) A constant relation. 2.  General expressions are madde out of sma

Defining internal classes and operations, Defining Internal Classes and Ope...

Defining Internal Classes and Operations When we enlarge algorithms, new classes can be added to the store intermediate results. A complex operation could be looked at, as a c

Sql, sql is relationally complete-justify

sql is relationally complete-justify

Dml precompiler in database management system, DML Precompiler All th...

DML Precompiler All the DBMS have two basic sets of Languages - Data Definition Language (DDL) that have the set of commands needed to define the format of the data that is b

Explain the rules for creating a labelled precedence graph, Explain the rul...

Explain the rules for creating a labelled precedence graph for testing view serializability.            Ans: A schedule S is view serializable if it is view equivalent to a ser

What are wait-for-graphs, What are wait-for-graphs?Give the algorithm to co...

What are wait-for-graphs?Give the algorithm to construct a wait-for-graph from a given schedule of transactions? How can deadlocks be detected from wait-for-graphs?   Ans:  The

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