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

关于多维数据库的Scalability

On the Scalability of Multidimensional Databases

István Szépkúti

摘要:

在数据库联机分析处理的实践中,人们普遍认为多维数据库组织的可伸缩性低于关系数据库组织。很容易看出,多维组织的规模可能会非常迅速地增加。例如,如果我们引入一个额外的维度,那么可能的细胞总数将至少增加一倍。然而,这种推理没有考虑到多维组织可以被压缩的事实。有压缩技术,可以从多维组织中删除所有或至少一部分空单元格,同时保持良好的检索性能。关系数据库通常使用B树索引来加速对给定表行的访问。在一些合理的假设下,可以证明表和B树索引的总大小大于压缩的多维表示。这意味着压缩数组可以同时实现更小的数据库和更快的访问速度。本文比较了几种压缩技术,并说明了何时应该和不应该应用压缩数组而不是关系表。

英文摘要:

It is commonly accepted in the practice of on-line analytical processing of databases that the multidimensional database organization is less scalable than the relational one. It is easy to see that the size of the multidimensional organization may increase very quickly. For example, if we introduce one additional dimension, then the total number of possible cells will be at least doubled. However, this reasoning does not takethe fact into account that the multidimensional organization can be compressed. There are compression techniques, which can remove all or at least a part of the empty cells from the multidimensional organization, while maintaining a good retrieval performance. Relational databases often use B-tree indices to speed up the access to given rows of tables. It can be proven, under some reasonable assumptions, that the total size of the table and the B-tree index is bigger than a compressed multidimensional representation. This implies that the compressed array results in a smaller database and faster access at the same time. This paper compares several compression techniques and shows when we should and should not apply compressed arrays instead of relational tables.

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

↑