arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0704.3500cs.DB
收藏

Une plate-form dynamique pour l'évaluation des performance des bases de données à objets

Une plate-forme dynamique pour l'évaluation des performances des bases de données à objets

Zhen He, Jérôme Darmont

摘要:

在面向对象或对象-关系数据库中,例如多媒体数据库或大多数XML数据库,访问模式不是静态的,即,应用程序并不总是以相同的顺序重复地访问相同的对象。然而,到目前为止,这一直是这些数据库和相关优化技术(如聚类)的评估方式。本文通过提出动态对象评估框架(DOEF),开启了对这一问题的研究。DOEF通过定义可配置的更改样式来完成访问模式更改。它是一个初步的原型,被设计为开放和完全可扩展的。虽然最初是为面向对象模型设计的,但它也可以在对象-关系模型中使用,只需进行少量修改。此外,还可以添加新的访问模式改变模型。为了说明DOEF的能力,我们进行了两组不同的实验。在第一组实验中,我们使用DOEF来比较四种最先进的动态聚类算法的性能。结果表明,DOEF是有效的,在确定每个动态聚类算法的适应性,以改变访问模式。他们还使我们得出结论,动态聚类算法可以应付中等水平的访问模式的变化,但性能迅速下降,比没有集群时,积极的访问模式变化的风格被应用。在第二组实验中,我们使用DOEF来比较两种不同对象存储的性能:Platypus和SHORE。DOEF的使用暴露了鸭嘴兽较差的交换性能。

英文摘要:

In object-oriented or object-relational databases such as multimedia databases or most XML databases, access patterns are not static, i.e., applications do not always access the same objects in the same order repeatedly. However, this has been the way these databases and associated optimisation techniques such as clustering have been evaluated up to now. This paper opens up research regarding this issue by proposing a dynamic object evaluation framework (DOEF). DOEF accomplishes access pattern change by defining configurable styles of change. It is a preliminary prototype that has been designed to be open and fully extensible. Though originally designed for the object-oriented model, it can also be used within the object-relational model with few adaptations. Furthermore, new access pattern change models can be added too. To illustrate the capabilities of DOEF, we conducted two different sets of experiments. In the first set of experiments, we used DOEF to compare the performances of four state of the art dynamic clustering algorithms. The results show that DOEF is effective at determining the adaptability of each dynamic clustering algorithm to changes in access pattern. They also led us to conclude that dynamic clustering algorithms can cope with moderate levels of access pattern change, but that performance rapidly degrades to be worse than no clustering when vigorous styles of access pattern change are applied. In the second set of experiments, we used DOEF to compare the performance of two different object stores: Platypus and SHORE. The use of DOEF exposed the poor swapping performance of Platypus.

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

↑