An extendible multidimensional array system for MOLAP

In MOLAP systems, multidimensional arrays are employed to store fact tables dumped from the frontend relational database. On these fact tables, various kinds of statistical computations such as aggregate operations can be performed efficiently by utilizing the fast random accessing capability of arrays. This capability depends on that the size of an employed multidimensional array is fixed in every dimension, so a simple addressing function can be used to access array elements. But, if a new column value emerges after constructing the fact table, the existing fixed size multidimensional array cannot involve the value. In this paper, we provide an extendible multidimensional array system for MOLAP. Such an array can extend its size dynamically along an arbitrary dimension without any relocation of existing data. This property enables incremental aggregate operations without relocating any data dumped at the latest time. Some problems in making this system work as a basis for MOLAP are stated, and their countermeasures are proposed.

[1]  Torben Bach Pedersen,et al.  Multidimensional Database Technology , 2001, Computer.

[2]  Yannis E. Ioannidis,et al.  Bitmap index design and evaluation , 1998, SIGMOD '98.

[3]  Tatsuo Tsuji,et al.  An implementation scheme of multidimensional arrays for MOLAP , 2002, Proceedings. 13th International Workshop on Database and Expert Systems Applications.

[4]  Professor Dr. Niklaus Wirth,et al.  Programming in Modula-2 , 1982, Springer Berlin Heidelberg.

[5]  Thorsten von Eicken,et al.  技術解説 IEEE Computer , 1999 .

[6]  Chin-Wan Chung,et al.  Exploiting Versions for On-line Data Warehouse Maintenance in MOLAP Servers , 2002, VLDB.

[7]  Patrick E. O'Neil,et al.  Improved query performance with variant indexes , 1997, SIGMOD '97.

[8]  T. H. Merrett,et al.  A storage scheme for extendible arrays , 2005, Computing.

[9]  Arnold L. Rosenberg.  Allocating Storage for Extendible Arrays , 1974, JACM.

[10]  Panos Vassiliadis,et al.  Modeling multidimensional databases, cubes and cube operations , 1998, Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243).

[11]  Michael Stonebraker,et al.  Efficient organization of large multidimensional arrays , 1994, Proceedings of 1994 IEEE 10th International Conference on Data Engineering.

[12]  Jeffrey F. Naughton,et al.  An array-based algorithm for simultaneous multidimensional aggregates , 1997, SIGMOD '97.

[13]  Peter Baumann,et al.  Performance evaluation of multidimensional array storage techniques in databases , 1999, Proceedings. IDEAS'99. International Database Engineering and Applications Symposium (Cat. No.PR00265).

[14]  Arnold L. Rosenberg,et al.  Hashing Schemes for Extendible Arrays , 1977, JACM.

[15]  J. Leon Zhao,et al.  Extendible arrays for statistical databases and OLAP applications , 1996, Proceedings of 8th International Conference on Scientific and Statistical Data Base Management.

[16]  Marianne Winslett,et al.  Physical schemas for large multidimensional arrays in scientific computing applications , 1994, Seventh International Working Conference on Scientific and Statistical Database Management.

[17]  Dorothy Bollman.  On Preserving Proximity in Extendible Arrays , 1976, SIAM J. Comput..

[18]  Alfred Novacek.  Using time stamps for storing and addressing extendible arrays , 2005, Computing.