By Topic

An enhanced grouping algorithm for vertical partitioning problem in DDBs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Farhi Marir ; Computer Science Dept., London Metropolitan University, UK ; Yahiya Najjar ; Mahmoud Y. AlFaress ; Hassan I. Abdalla

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.

Published in:

Computer and information sciences, 2007. iscis 2007. 22nd international symposium on

Date of Conference:

7-9 Nov. 2007