NAME: MATHEW YUMBYA MAKAU
REG: 19/02580
BIT3202A: DISTRIBUTED DATABASE SYSTEMS
CAT 2
, a). Discuss using examples on how the following Algorithms are
accomplished.
i. Bond Energy Algorithm:
The bond energy algorithm 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.
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.
ii. BEA:
BEA is one of the algorithms used in the process of Vertical
fragmentation, information given about the use of attributes with
traksasi initially converted into a square matrix, referred to as the
attribute affinity matrix. The next step will be in this matrix is
diagonalized by the algorithm cluster as the basis for calculating the
bond energy algorithm
b). Explain the various design issues of Distributed Database.
I. Openness: The openness of the distributed system is determined
primarily by the degree to which new resource-sharing services can be
made available to the users.
II. Heterogeneity: Heterogeneity is applied to the network, computer
hardware, operating system and implementation of different developers.
A key component of the heterogeneous distributed system client-server
environment is middleware.
III. Security: Security of information system has three components
confidentially, integrity and availability. Encryption protects shared
resources, keeps sensitive information secrets when transmitted.
IV. Scalability: Scalability of the system should remain efficient even with
a significant increase in the number of users and resources connected. It
shouldn’t matter if a program has 10 or 100 nodes, performance
shouldn’t vary.
REG: 19/02580
BIT3202A: DISTRIBUTED DATABASE SYSTEMS
CAT 2
, a). Discuss using examples on how the following Algorithms are
accomplished.
i. Bond Energy Algorithm:
The bond energy algorithm 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.
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.
ii. BEA:
BEA is one of the algorithms used in the process of Vertical
fragmentation, information given about the use of attributes with
traksasi initially converted into a square matrix, referred to as the
attribute affinity matrix. The next step will be in this matrix is
diagonalized by the algorithm cluster as the basis for calculating the
bond energy algorithm
b). Explain the various design issues of Distributed Database.
I. Openness: The openness of the distributed system is determined
primarily by the degree to which new resource-sharing services can be
made available to the users.
II. Heterogeneity: Heterogeneity is applied to the network, computer
hardware, operating system and implementation of different developers.
A key component of the heterogeneous distributed system client-server
environment is middleware.
III. Security: Security of information system has three components
confidentially, integrity and availability. Encryption protects shared
resources, keeps sensitive information secrets when transmitted.
IV. Scalability: Scalability of the system should remain efficient even with
a significant increase in the number of users and resources connected. It
shouldn’t matter if a program has 10 or 100 nodes, performance
shouldn’t vary.
