Abstract
In this paper we describe an efficient implementation scheme for MOLAP internal basic data structure based on extendible multidimensional arrays. In general, MOLAP implementation scheme employs multidimensional array as their basic data structure. But most of the cases the implemented arrays are very sparse when employed to store front end relational tables in OLTP systems. Moreover conventional multidimensional arrays cannot be extended when new column values needs to be added. In this paper, to solve these problems, the concept of extendible array is used. The effectiveness of extendible array for MOLAP implementation is shown by means of both theoretical analysis and experimental results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gray, J., Bosworth, A., Layman, A., Pirahesh, H.: Data cube: A relational aggregation operation generalizing group-by, cross-tabs and sub-totals, Technical Report MSR-TR-95-22, Microsoft Research, Advance Technology Division, Redmond (1995)
Harinarayan, V., Rajaraman, A., Ullman, J.D.: Implementing data cube efficiently. In: Proc. of ACM-SIGMOD Conf. Management of data, pp. 205–216 (1996)
Gupta, H., Harinarayan, V., Rajraman, A., Ullman, J.D.: Index selection for OLAP. In: Proc. of ICDE, pp. 208–219 (1997)
Kotidis, Y., Roussoppoulos, N.: An alterntive storage organization for ROLAP aggregation views based on cubetrees. In: Proc. ACM-SIGMOD conf. Management of data, pp. 89–99 (1998)
Zhao, Y., Deshpande, P.M., Naughton, J.F.: An array-based algorithm for simultaneous multidimensional aggregates. In: Proceedings of the ACM SIGMOD Conference on Management of Data, pp. 159–170 (1997)
Li, J., Srivastava, J.: Efficient aggregation algorithms for compressed data warehouses. IEEE Transaction on Knowledge and Data Engineering 14(3), 515–529 (2002)
Otoo, E.J., Merrett, T.H.: A storage scheme for extendible arrays. Computing 31, 1–9 (1983)
Azharul Hasan, K.M., Kuroda, M., Azuma, N., Tsuji, T., Higuchi, K.: An Extendible Array Based Implementation of Relational Tables for Multi Dimensional Databases. In: Tjoa, A.M., Trujillo, J. (eds.) DaWaK 2005. LNCS, vol. 3589, pp. 233–242. Springer, Heidelberg (2005)
Rotem, D., Zaho, J.L.: Extendible arrays for statistical databases and OLAP applications. In: Proc. of SSDBM’96, pp. 108–117 (1996)
Sarawagi, S., Stonebraker, M.: Efficient organization of large multidimensional arrays. In: Proc. of ICDE, pp. 328–336 (1994)
Shukla, A., Deshpande, P.M., Naughton, J.F.: Materialized view selection for multidimensional datasets. In: Proc. of VLDB Conf., pp. 488–499 (1998)
Ross, K.A., Srivastava, D.: Fast computation of sparse data cubes. In: Proc. of VLDB conf., pp. 116–125 (1997)
AgarwaI, S., Agrawal, R., Deshpande, P.M., Gupta, A., Naughton, J.F., Sarawagi, S.: On the computation of multidimensional aggregates. In: Proc. of VLDB, pp. 506–521 (1996)
Muto, S., Kitsuregawa, M.: Improving main memory for array-based data cube computation. In: Proc. of workshop on Data warehousing and OLAP, pp. 28–33 (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hasan, K.M.A., Tsuji, T., Higuchi, K. (2007). An Efficient Implementation for MOLAP Basic Data Structure and Its Evaluation. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds) Advances in Databases: Concepts, Systems and Applications. DASFAA 2007. Lecture Notes in Computer Science, vol 4443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71703-4_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-71703-4_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71702-7
Online ISBN: 978-3-540-71703-4
eBook Packages: Computer ScienceComputer Science (R0)