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

基于数据采掘的XML数据仓库分片

Data Mining-based Fragmentation of XML Data Warehouses

Hadj Mahboubi, Jérôme Darmont

摘要:

随着XML数据源的增加,人们提出了许多XML数据仓库模型来处理关系型数据仓库无法处理的数据异构性和复杂性。然而,XML原生数据库系统目前在可管理的数据量和响应时间方面的性能有限。分散化有助于解决这两个问题。派生的水平分段通常用于关系数据仓库,并且可以明确地适应XML上下文。然而,由经典算法产生的片段的数量是难以控制的。在本文中,我们提出了一种基于k-均值的碎片化方法,允许通过其$k$参数掌握碎片的数量。通过实验比较了该算法与经典的适用于XML数据仓库的水平分片算法的效率,证明了该算法的优越性。

英文摘要:

With the multiplication of XML data sources, many XML data warehouse models have been proposed to handle data heterogeneity and complexity in a way relational data warehouses fail to achieve. However, XML-native database systems currently suffer from limited performances, both in terms of manageable data volume and response time. Fragmentation helps address both these issues. Derived horizontal fragmentation is typically used in relational data warehouses and can definitely be adapted to the XML context. However, the number of fragments produced by classical algorithms is difficult to control. In this paper, we propose the use of a k-means-based fragmentation approach that allows to master the number of fragments through its $k$ parameter. We experimentally compare its efficiency to classical derived horizontal fragmentation algorithms adapted to XML data warehouses and show its superiority.

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

↑