Efficient distribution of data is a major challenge in distributeddatabases. The problem is even more severe for distributed object oriented databases because of inheritance, encapsulation and the more complex proble...
详细信息
ISBN:
(纸本)188084348X
Efficient distribution of data is a major challenge in distributeddatabases. The problem is even more severe for distributed object oriented databases because of inheritance, encapsulation and the more complex problem involved when methods invoke other methods. This problem is a harder version of the relational database allocation problem (DAP), a problem known to be NP-haxd. We looked at the problem of developing an efficient heuristic for allocating object fragments in a distributed object oriented database. To accomplish this we created a genetic algorithm which produced more favorable results as compared to the graphical algorithm of Barker and Bhar [2]. Our results show near optimal allocation for those configurations in which the optimal could be computed, improvement over the graphical algorithm and has a linear running time.
暂无评论