Scribd
Upload
397 views5 pages

BEA Algorithm

The bond energy algorithm (BEA) clusters database attributes into vertical fragments based on their frequency of common usage. It creates an attribute affinity matrix based on usage frequencies, converts it to a bond matrix grouping similar attributes, and identifies clusters by drawing boxes around high similarity regions. The algorithm aims to store frequently accessed attribute pairs together to improve performance.

Uploaded by

Rashid surani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
397 views5 pages

BEA Algorithm

The bond energy algorithm (BEA) clusters database attributes into vertical fragments based on their frequency of common usage. It creates an attribute affinity matrix based on usage frequencies, converts it to a bond matrix grouping similar attributes, and identifies clusters by drawing boxes around high similarity regions. The algorithm aims to store frequently accessed attribute pairs together to improve performance.

Uploaded by

Rashid surani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Bond Energy Algorithm

Vertical Fragmentation in DDB


Introduction
• The bond energy algorithm (BEA) was developed and has been used in the database
design area to determine how to group data and how to physically place data on a disk.

• It can be used to cluster attributes based on usage and then perform logical or physical
design accordingly. With BEA, the affinity (bond) between database attributes is based on
common usage.

• This bond is used by the clustering algorithm as a similarity measure. The actual measure
counts the number of times the two attributes are used together in each time. To find this,
all common queries must be identified.

• The idea is that attributes that are used together form a cluster and should be stored
together. In a distributed database, each resulting cluster is called a vertical fragment and
may be stored at different sites from other fragments.
Algorithm steps
The basic steps of this clustering algorithm are:

1. Create an attribute affinity matrix in which each entry indicates the


affinity between the two associate attributes. The entries in the
similarity matrix are based on the frequency of common usage of
attribute pairs.

2. The BEA then converts this similarity matrix to a BOND matrix in


which the entries represent a type of nearest neighbor bonding based
on probability of co-access. The BEA algorithm rearranges rows or
columns so that similar attributes appear close together in the matrix.
3. Finally, the designer draws boxes around regions in the matrix
with high similarity.

The resulting matrix, modified from, is illustrated in Figure. The two


shaded boxes represent the attributes that have been grouped
together into two clusters.
• Two attributes Ai and Aj have a high affinity if they are frequently
used together in database applications. At the heart of the BEA
algorithm is the global affinity measure. Suppose that a database
schema consists of n attributes {A1, A2, , An}. The global affinity
measure, AM, is defined as

You might also like