View : 40 Download: 0

A bitmap index for multidimensional data cubes

Title
A bitmap index for multidimensional data cubes
Authors
Lim Y.Kim M.
Ewha Authors
김명
SCOPUS Author ID
김명scopus
Issue Date
2004
Journal Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN
0302-9743JCR Link
Citation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) vol. 3180, pp. 349 - 358
Indexed
SCOPUS scopus
Document Type
Article
Abstract
Multidimensional arrays can be used to store multidimensional data cubes. One way of storing such array onto disk is to partition the array into a set of small chunks that can fit in a disk block. Chunks are usually of the same side length and are compressed before being stored, in order to achieve high query processing speed and space utilization. This scheme is called the chunk-based cube storage scheme. Although the scheme is considered to be a position based storage scheme, the chunks cannot be retrieved fast without using indexes since they are compressed. In this paper, we propose a bitmap index for such a storage scheme. The index can be constructed with the data cube in parallel. The relative positions of the chunks are retained in the index so that the chunk retrieval can be done in constant time. We placed in an index block as many chunks as possible so that the number of index searches is minimized for OLAP operations such as slice, dice, and range queries. We evaluated the proposed index by comparing it with existing multidimensional indexes such as UB-tree and grid file in terms of time and space. © Springer-Verlag Berlin Heidelberg 2004.
Appears in Collections:
엘텍공과대학 > 컴퓨터공학과 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE