horizontal fragmentation, Database Management System

Horizontal Fragmentation-Horizontal fragmentation groups together the tuples in a relation that are collectively used by the main transactions. A horizontal fragment is produced by specifying a WHERE clause condition that shows a restriction on the tuples in the relation. It can also be described using the Selection operation of the relational algebra.

Example:

Let us demonstrate horizontal fragmentation with the help of an example.

 DEPOSIT (branch-code, account-number, customer-name, balance)

A sample relation instance of the relation DEPOSIT is shown in Figure.

Branch-code

Account number

Customer name

Balance

1101

3050

Suresh

5000

1101

2260

Swami

3360

1102

1170

Swami

2050

1102

4020

Khan

10000

1101

1550

Khan

620

1102

4080

Khan

1123

1102

6390

Khan

7500

                                                              Figure: Sample DEPOSIT relation

Mathematically a fragment may be described as a selection on the global relation R. The reconstruction of the relation R can be taken by taking the union of all fragments.

So let us decay the table in Figure into horizontal fragments. Let us do these fragments on the branch-code as 1101 and 1102

DEPOSIT1 obtained by selection on branch-code as 1101

Branch-code

Account number

Customer name

Balance

1101

3050

Suresh

5000

1101

2260

Swami

3360

1101

1550

Khan

620

DEPOSIT2 obtained by selection on branch- code as 1102

Branch-code

Account number

Customer name

Balance

1102

1770

Swami

2050

1102

4020

Khan

10000

1102

4080

Khan

1123

1102

6390

Khan

7500

 

 

 

 

 

 

 

 

 

                                        Figure: Horizontal fragmentation of relation DEPOSIT

 

The two fragments can be described in relational algebra as:

 

DEPOSIT1 = σ branch-code= 1101 (DEPOSIT)

DEPOSIT2 = σ branch-code= 1102 (DEPOSIT)

These two fragments are given in Figure. Fragment 1 can be stored in the branch whose code is 1101 whereas the second fragment can be stored at branch 1102.

In our example, the fragments are disjoint. Though, by changing the selection predicates used to construct the fragments; we may have overlapping horizontal fragments. This is a type of data replication.

Posted Date: 3/13/2013 8:39:45 AM | Location : United States







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

Write discussion on horizontal fragmentation
Your posts are moderated
Related Questions
Modular growth: In distributed environments, it is simple to expand. Latest sites can be added to the network without affecting the operations of other sites, as they are somewhat

Which database level is closest to the users? External database level is closest to the users.

Structure Of Distributed Database: A distributed database system haves of a collection of sites, each of which keeps a local databases system. Every site is able to process local

Create Student DB and perform delete operation? STUDENT (name, student#, class, major) COURSE (course name, course#, credit hours, department) SECTION (section identifier, co

Explain the Concept of Two-phase Locking It concerns the positions of locking and unlocking operations in each transaction.  In this protocol every transaction issue lock and u

Let us now make the E-R diagram for the student database as per the explanation given in the previous section. We can also states the overall logical structure of a database usi

Physical Records These are the records that are stored in the secondary storage devices. For the database relation, physical records are the group of fields kept in adjacent me

What is Data Storage? The storage structures and access methods used by database system are specified by a set of explanation in a special type of DDL called data storage-defin

what is object-identity

Describe the four main ways of optimising disk block access. Ans: a. Disk  b. Non-volatile writes buffers c. File organization (Clustering) d. Log-based file system