Design and Implementation of Distribution in Distributed Object-Oriented Databases


The KIPS Transactions:PartB , Vol. 11, No. 5, pp. 611-618, Aug. 2004
10.3745/KIPSTB.2004.11.5.611,   PDF Download:

Abstract

This paper addresses the design and implementation of class distribution in distributed object-oriented databases. The proposed strategy of distribution consists of two-step design of fragments. One is class fragmentation and the other is allocation of fragments. In step of class fragmentation, we have defined partitioning algorithms to reflect the characteristics of object-oriented databases such as method, inheritance and composite-object. In step of allocation, we have defined the objective function for allocation considering system operating cost including storage, query processing and communication and implemented it using Genetic Algorithm.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. M. Lee, H. S. Park, Y. Ha, "Design and Implementation of Distribution in Distributed Object-Oriented Databases," The KIPS Transactions:PartB , vol. 11, no. 5, pp. 611-618, 2004. DOI: 10.3745/KIPSTB.2004.11.5.611.

[ACM Style]
Soon Mi Lee, Hea Sook Park, and Yan Ha. 2004. Design and Implementation of Distribution in Distributed Object-Oriented Databases. The KIPS Transactions:PartB , 11, 5, (2004), 611-618. DOI: 10.3745/KIPSTB.2004.11.5.611.