An enhanced grouping algorithm for vertical partitioning problem in DDBs

Distribution design involves making decisions on the fragmentation and allocation of data across the sites of a computer network. Vertical partitioning is the process of subdividing the attributes of a relation to generate fragments. In this paper, we propose an enhancement to our previous work for...

Full description

Saved in:
Bibliographic Details
Main Authors: Marir, F., Najjar, Y., AlFaress, M.Y., Abdalla, H.I.
Format: Conference Proceeding
Language:English
Subjects:
Clustering algorithms
Computer networks
Computer science
Cost function
Database systems
Design optimization
Distributed databases
Intelligent networks
Iterative methods
Partitioning algorithms
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Distribution design involves making decisions on the fragmentation and allocation of data across the sites of a computer network. Vertical partitioning is the process of subdividing the attributes of a relation to generate fragments. In this paper, we propose an enhancement to our previous work for vertical partitioning algorithm using grouping approach. This algorithm starts from the attribute affinity matrix and generates initial groups based on the affinity values between attributes. Then, it attempts to merge the initial groups to produce final groups that will represent the fragments.
DOI:10.1109/ISCIS.2007.4456833