DBPapers
DOI: 10.5593/SGEM2014/B21/S7.002

A HORIZONTAL FRAGMENTATION ALGORITHM FOR DISTRIBUTED DATABASES

A. Runceanu
Wednesday 1 October 2014 by Libadmin2014

References: 14th International Multidisciplinary Scientific GeoConference SGEM 2014, www.sgem.org, SGEM2014 Conference Proceedings, ISBN 978-619-7105-10-0 / ISSN 1314-2704, June 19-25, 2014, Book 2, Vol. 1, 11-18 pp

ABSTRACT
In this paper we present a horizontal fragmentation algorithm for design phase of a distributed databases. Our results has implemented in case of university databases application. We propose a matrix with values for attributes is used by the database administrator in the requirement analysis phase of system development life cycle for making decision of data mapping to different locations. Our matrix name is SIDU (S - Select, I - Insert D - Delete, and U - Update). It is a table constructed by placing predicates of attributes of a relation as the rows and applications of the sites of a DDBMS as the columns. We have used SIDU to generate ACF array with values for each relation. We treated cost as the effort of access and modification of a particular attribute of a relation by an application from a particular site.

Keywords: distributed databases, horizontal fragmentation, algorithm, attribute frequency matrix

Home | Contact | Site Map | Site statistics | Visitors : 346 / 353063

Follow site activity en  Follow site activity INFORMATICS  Follow site activity Papers SGEM2014   ?

CrossRef Member    Indexed in ISI Web Of Knowledge   Indexed in ISI Web Of Knowledge
   

© Copyright 2001 International Multidisciplinary Scientific GeoConference & EXPO SGEM. All Rights Reserved.

Creative Commons License