Academic
Publications
Performance Evaluation for Clustering Algorithms in Object-Oriented Database Systems

Performance Evaluation for Clustering Algorithms in Object-Oriented Database Systems,10.1007/BFb0049117,Computing Research Repository,Jérôme Darmont,A

Performance Evaluation for Clustering Algorithms in Object-Oriented Database Systems  
BibTex | RIS | RefWorks Download
It is widely acknowledged that good object clustering is crit- ical 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 method- ology has been used to compare the performances of three clustering algorithms found in the literature (Cactis, CK and ORION) that we considered representative of the current research in the field of object clustering. The actual performance evaluation was performed using sim- ulation. Simulation experiments we performed showed that the Cactis algorithm is better than the ORION algorithm and that the CK algo- rithm totally outperforms both other algorithms in terms of response time and clustering overhead. Keywords: Clustering, Computer systems performance evaluation me- thodology, Object-oriented databases, Simulation.
Journal: Computing Research Repository - CORR , vol. abs/0705.0, 2007
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.