An implementation scheme of multidimensional arrays for MOLAP

T. Tsuji, Atsuo Isshiki, T. Hochin, K. Higuchi
{"title":"An implementation scheme of multidimensional arrays for MOLAP","authors":"T. Tsuji, Atsuo Isshiki, T. Hochin, K. Higuchi","doi":"10.1109/DEXA.2002.1045991","DOIUrl":null,"url":null,"abstract":"Multidimensional arrays used in MOLAP are often sparse. They also suffer from the problem that the time consumed in sequential access to array elements heavily depends on the dimension along which the elements are accessed. This problem would be alleviated by dividing the whole array into the set of the same sized smaller subarrays called \"chunks\". These chunks are also sparse and they are compressed. However these compressed chunks are usually arranged in the predetermined order of the dimensions. This would produce further dimension dependency in accessing array elements. In this paper, by introducing the notion of a \"chunk container\", we resolve the problem of this further dimension dependency.","PeriodicalId":254550,"journal":{"name":"Proceedings. 13th International Workshop on Database and Expert Systems Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 13th International Workshop on Database and Expert Systems Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DEXA.2002.1045991","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Multidimensional arrays used in MOLAP are often sparse. They also suffer from the problem that the time consumed in sequential access to array elements heavily depends on the dimension along which the elements are accessed. This problem would be alleviated by dividing the whole array into the set of the same sized smaller subarrays called "chunks". These chunks are also sparse and they are compressed. However these compressed chunks are usually arranged in the predetermined order of the dimensions. This would produce further dimension dependency in accessing array elements. In this paper, by introducing the notion of a "chunk container", we resolve the problem of this further dimension dependency.
面向MOLAP的多维数组实现方案
在MOLAP中使用的多维数组通常是稀疏的。它们还存在这样一个问题,即顺序访问数组元素所消耗的时间在很大程度上取决于访问元素的维度。这个问题可以通过将整个数组分成一组大小相同的更小的子数组来缓解,这些子数组称为“块”。这些块也是稀疏的,并且是压缩的。然而,这些压缩块通常按照预定的尺寸顺序排列。这将在访问数组元素时产生进一步的维度依赖。在本文中,通过引入“块容器”的概念,我们解决了这种进一步的维度依赖问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信