The Internet Archive has a preservation copy of this work in our general collections.
The file type is
It is widely acknowledged that good object clustering is critical to the performance of object-oriented databases. However, object clustering always involves some kind of overhead for the system. The aim of this paper is to propose a modelling methodology in order to evaluate the performances of different clustering policies. This methodology has been used to compare the performances of three clustering algorithms found in the literature (Cactis, CK and ORION) that we considered representativearXiv:0705.0454v1 fatcat:ccjyal4jd5hjpajngd2epi2kvm