International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 119 - Number 2 |
Year of Publication: 2015 |
Authors: Nishant Gaurav |
10.5120/21040-3491 |
Nishant Gaurav . A Vertical Partitioning Algorithm for Distributed Object Oriented Databases. International Journal of Computer Applications. 119, 2 ( June 2015), 19-24. DOI=10.5120/21040-3491
Object Oriented Databases (OODB) is becoming popular day by day and being used in a large number of application domains. In order to support homogeneous distributed OODBs a clear understanding of partitioning of class and how to do it by using different partitioning algorithms is needed. In this paper an algorithm for vertical fragmentation in a model consisting of class and comprising of complex attributes and complex methods is presented. The approach for fragmentation is top-down and entity of fragmentation is class. The algorithm presented here is an enhancement to the previous work of vertical partitioning algorithms in OODB management systems. The algorithm takes input as the class to be partitioned into fragments or groups, generates Method Usage Matrix as its first step from the methods and queries provided. It then generates Method Affinity matrix which is constructed using above matrix and based on method affinity values of two methods. Two new factors are introduced Method Linking Factor and Group Linking Factor which provides more control on deciding groups and increasing the flexibility of the algorithm.