Browse > Article

A Bitmap Index for Chunk-Based MOLAP Cubes  

Lim, Yoon-Sun (이화여자대학교 과학기술대학원 컴퓨터학과)
Kim, Myung (이화여자대학교 과학기술대학원 컴퓨터학과)
Publication Information
Journal of KIISE:Databases / v.30, no.3, 2003 , pp. 225-236 More about this Journal
Abstract
MOLAP systems store data in a multidimensional away called a 'cube' and access them using way indexes. When a cube is placed into disk, it can be Partitioned into a set of chunks of the same side length. Such a cube storage scheme is called the chunk-based MOLAP cube storage scheme. It gives data clustering effect so that all the dimensions are guaranteed to get a fair chance in terms of the query processing speed. In order to achieve high space utilization, sparse chunks are further compressed. Due to data compression, the relative position of chunks cannot be obtained in constant time without using indexes. In this paper, we propose a bitmap index for chunk-based MOLAP cubes. The index can be constructed along with the corresponding cube generation. The relative position of chunks is retained in the index so that 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 range queries. We showed the proposed index is efficient by comparing it with multidimensional indexes such as UB-tree and grid file in terms of time and space.
Keywords
OLAP; Chunk-based MOLAP Cube; Multidimensional Indexes;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Yihong Zhao, Prasad Deshpande, Jeffrey Naughton, 'An Array-Based Algorithm for Simultaneous Multidimensional Aggregates,' Proc, ACM SIGMOD, pp. 159-170, 1997   DOI   ScienceOn
2 Hosagrahar V. ]agadish, 'linear Clustering of Objects with Multiple Attributes,' Proc, ACM SIGMOD, pp. 332-342, 1990   DOI
3 Prasad M. Deshpande, Karthikeyan Rarnasarny, Amit Shukla, jeffrey F. Naughton, 'Caching Multidimensional Queries Using Chunks,' Proc, ACM SIGMOD, pp. 259-270, 1998   DOI   ScienceOn
4 Jurg. Neivergelt, Hans Hinterberger, Kenneth C. Sevcik, 'The Grid File: An Adaptable, Symmetric Multikey File Structure,' ACM Transactions on Database Systems, Vol. 9, No.1, pp. 38-71, March 1984   DOI   ScienceOn
5 Arbor Software Corporation, Robert J. Earle, U.S. Patent #5359724, 1994
6 Antonin Guttman, 'R-Trees: A Dynamic Index Structure for Spatial Searching,' Proc, ACM SIGMOD, pp. 47-57, Boston, 1984   DOI
7 Rudolf Bayer, 'The Universal B-Tree for Multidimensional Indexing', Technische Universitat Munchen, TUM-I9637, November 1996
8 S. Sarawagi, M. Stonebraker, 'Efficient Organization of Large Multidimensional Arrays,' Proc, 10th ICDE, Feb. 1994   DOI
9 Chee-Yong Chan, Yannis E. Ioannidis, 'Bitmap index design and evaluation,' Proc. ACM SIGMOD, pp, 355-366, June 1998   DOI   ScienceOn
10 Kyu-Young Whang, Ravi Krishnarnurthy, 'The Multilevel Grid File-A Dynamic Hierarchical Multidimensional File Structure', DSFAA, pp. 449-459, 1991
11 Michael Freeston. 'The bang file: a new kind of grid file,' Proc, ACM SIGMOD, pp. 260-269, 1987   DOI
12 Patrick O'Neil, Goetz Graefe, 'Multi-Table Joins Through Bitmapped Join Indices,' SIGMOD Record 24(3), September 1995   DOI   ScienceOn
13 Ming-Chuan Wu, Alejandro P. Buchmann. 'Encoded bitmap indexing for data warehouses,' Proc. 14th ICDE, Orlando, Florida, pp. 220-230, 1998   DOI
14 Patrick O'Neil, Dallan Quass. 'Improved Query Performance with Variant Indexes,' Proc. ACM SIGMOD, pp. 38-49, Tucson, Arizona, 1997   DOI
15 Myung Kim, Yoonsun Lim, 'A Z index based MOLAP Storage Scheme', Journal of Korea Information Science Society, Vol. 29, No.4, pp. 262-273, August 2002   과학기술학회마을
16 MicroStrategy, Inc., 'The Case for Relational-OLAP', White Paper, http://www.microstrategy.com/files/whitepapers/wp_rolap.pdf, 2000
17 Comshare, Inc., 'ROLAP:그 기대치와 현실', White Paper, http://www.olapforum.com/ForumOLAP/OLAP%20General/White%20paper/ROLAP-그%20기대치와%20현실.asp, 1995.(금용찬(역))