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.

 

Posted Date: 3/13/2013 8:41:23 AM | Location : United States

Ask an Expert

Related Discussions:- Vertical fragmentation, Assignment Help, Ask Question on Vertical fragmentation, Get Answer, Expert's Help, Vertical fragmentation Discussions

Write discussion on Vertical fragmentation
Your posts are moderated

Write your message here..

Related Questions

Student management system, projects? projects?

Sql, Events4Fun is an event management company in Europe with branches in S... Events4Fun is an event management company in Europe with branches in South America as well. The company is well-known for its efficiency, good-quality services, and affordable char

Explain the term- inheritance, What is inheritance? Inheritance is an ... What is inheritance? Inheritance is an object orientation concept that allows reusability of code / design. Basic sense of inheritance is that if one class is predefined than a

Database schema, #Use the following database schema: 1) Patient—PatientID, ... #Use the following database schema: 1) Patient—PatientID, Name, DOB 2) Doctor—DoctorID, Name, MedLicenseNumber, Phone 3) Medication—MedicationID, BrandName, GenericName 4) Prescrip

Explain trivial dependency, Explain trivial dependency? Functional depe... Explain trivial dependency? Functional dependency of the form α ->β. is trivial if α C β. Trivial functional dependencies are satisfied by all the relations.

What are the two statements regarding transaction, What are the two stateme... What are the two statements regarding transaction? The two statements regarding transaction of the form are:- A)     Begin transaction B)      End transaction

Define canonical cover, Define canonical cover? A canonical cover Fc fo... Define canonical cover? A canonical cover Fc for F is a set of dependencies like F logically implies all dependencies in FC and Fc logically shows all dependencies in F.

Example of equijoin, Example: Consider the following relations: ... Example: Consider the following relations: ROLLNO NAME ADDRESS COURSE_ID 100 Ka

Describe physical data independence, Describe Physical Data independence ? ... Describe Physical Data independence ? Physical Data Independence - It is capacity to modify the internal schema without having to change conceptual schema. Therefore, the exter

What is data block, What is data block? Data Block - In oracle the data... What is data block? Data Block - In oracle the data blocks are referred to as tablespaces. A tablespace is an fields of disk consisting of one or more disk files. A tablespace