arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1611.09176cs.DB
收藏

对OODB中的聚类算法进行仿真,以评估其性能

Simulation of clustering algorithms in OODBs in order to evaluate their performances

Jérôme Darmont, Amar Attoui, Michel Gourgand

摘要:

良好的对象聚类对面向对象数据库的性能至关重要。但是,它总是涉及系统的某种开销。本文的目的是提出一种建模方法,以评估不同的聚类政策的性能。这种方法已被用来比较三个聚类算法的性能发现在文献中(Cactis,CK和ORION),我们认为目前的研究领域的对象聚类的代表。使用模拟进行实际性能评估。仿真实验表明,Cactis算法优于ORION算法,CK算法在响应时间和分簇开销方面完全优于其他两种算法。

英文摘要:

A good object clustering is critical to the performance of object-oriented databases. However, it 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 representative of the current research in the field of object clustering. The actual performance evaluation was performed using simulation. Simulation experiments showed that the Cactis algorithm is better than the ORION algorithm and that the CK algorithm totally outperforms both other algorithms in terms of response time and clustering overhead.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑