Dynamic multidimensional data cubes
Abstract
Data cubes are ubiquitous tools in data warehousing, online analytical processing, and decision support applications. Based on a selection of pre-computed and materialized aggregate values, they can dramatically speed up aggregation and summarization over large data collections. Traditionally, the emphasis has been on lowering query costs with little regard to maintenance, i.e., update cost issues. We argue that current trends require data cubes to be not only query-efficient, but also dynamic at the same time, and we also show how this can be achieved. Several array-based techniques with different tradeoffs between query and update cost are discussed in detail. We also survey selected approaches for sparse data and the popular data cube operator, CUBE. Moreover, this work includes an overview of future trends and their impact on data cubes.
References
[1]
Baralis, E., Paraboschi, S., & Teniente, E. (1997). Materialized view selection in a multi-dimensional database. Proceedings of the International Conference on Very Large Databases (VLDB'97), 156-165.]]
[2]
Beyer, K., & Ramakrishnan, R. (1999). Bottom-up computation of sparse and iceberg CUBES. Proceedings of the ACM International Conference on Management of Data (SIGMOD'99), 359-370.]]
[3]
Chaudhuri, S., & Dayal, U. (1997). An overview of data warehousing and OLAP technology. SIGMOD Record, 26(1), 65-74.]]
[4]
Chazelle, B. (1988). A functional approach to data structures and its use in multidimensional searching. SIAM Journal on Computing, 17(3), 427-462.]]
[5]
Chazelle, B. (1990). Lower bounds for orthogonal range searching: II. The arithmetic model. Journal of the ACM, 37(3), 439-463.]]
[6]
Chan, C.-Y., & Ioannidis, Y.E. (1999). Hierarchical cubes for range-sum queries. Proceedings of the International Conference on Very Large Databases (VLDB '99), 675-686. Extended version published as Technical Report, University of Wisconsin.]]
[7]
de Berg, M., van Kreveld, M., Overmars, M., & Schwarzkopf, O. (2000). Computational Geometry (2nd Ed.). Springer Verlag.]]
[8]
Fredman, M.L. (1981). A lower bound on the complexity of orthogonal range queries. Journal of the ACM, 28(4), 696-705.]]
[9]
Gaede, V., & Güünther, O. (1998). Multidimensional access methods. ACM Computing Surveys, 30(2), 170-231.]]
[10]
Geffner, S., Agrawal, D., & El Abbadi, A. (2000). The dynamic data cube. Proceedings of the International Conference on Extending Database Technology (EDBT'00), 237-253.]]
[11]
Geffner, S., Agrawal, D., El Abbadi, A., & Smith, T. (1999). Relative prefix sums: An efficient approach for querying dynamic OLAP data cubes. Proceedings of the International Conference on Data Engineering (ICDE'99), 328-335.]]
[12]
Geffner, S., Riedewald, M., Agrawal, D., & El Abbadi, A. (1999). Data cubes in dynamic environments. Data Engineering Bulletin, 22(4), 31-40.]]
[13]
Goil, S., & Choudhary, A. (1997). BESS: Sparse Data Storage of Multi-Dimensional Data for OLAP and Data Mining. Technical Report, North-western University.]]
[14]
Gray, J., Chaudhuri, S., Bosworth, A., Layman, A., Reichart, D., Venkatrao, M., Pellow, F., & Pirahesh, H. (1997). Data cube: A relational aggregation operator generalizing group-by, cross-tab and sub-totals. Journal of Data Mining and Knowledge Discovery, 1(1), 29-54.]]
[15]
Gupta, H., Harinarayan, V., Rajaraman, A., & Ullman, J.D. (1997). Index selection for OLAP. Proceedings of the International Conference on Data Engineering (ICDE'97), 208-219.]]
[16]
Gupta, H., & Mumick, I.S. (1999). Selection of views to materialize under a maintenance cost constraint. Proceedings of the International Conference on Database Theory (ICDT '99), 453-470.]]
[17]
Gupta, H. (1997). Selection of views to materialize in a data warehouse. Proceedings of the International Conference on Database Theory (ICDT'97), 98-112.]]
[18]
Guttman, A. (1984). R-trees: A dynamic index for spatial searching. Proceedings of the ACM International Conference on Management of Data (SIGMOD'84), 47-57.]]
[19]
Harinarayan, V., Rajaraman, A., & Ullman, J.D. (1996). Implementing data cubes efficiently. Proceedings of the ACM International Conference on Management of Data (SIGMOD '96), 205-216.]]
[20]
Ho, C., Agrawal, R., Megiddo, N., & Srikant, R. (1997). Range queries in OLAP data cubes. Proceedings of the ACM International Conference on Management of Data (SIGMOD '97), 73-88.]]
[21]
Johnson, T., & Shasha, D. (1997). Some index design for cube forests. IEEE Data Engineering Bulletin, 20(1), 27-35.]]
[22]
Johnson, T., & Shasha, D. (1999). Some index design for cube forests. IEEE Data Engineering Bulletin, 22(4), 31-40.]]
[23]
Koudas, N., Muthukrishnan, S., & Srivastava, D. (2000). Optimal histograms for hierarchical range queries. Proceedings of the Symposium on Principles of Database Systems (PODS'00), 196-204.]]
[24]
Lazaridis, I., & Mehrotra, S. (2001). Progressive approximate aggregate queries with a multi-resolution tree structure. Proceedings of the ACM International Conference on Data (SIGMOD '01), 401-412.]]
[25]
Lee, S.Y., Ling, T.W., & Li, H.G. (2000). Hierarchical compact cube for range-max queries. Proceedings of the International Conference on Very Large Databases (VLDB'00), 232-241.]]
[26]
Mumick, I.S., Quass, D., & Mumick, B.S. (1997). Maintenance of data cubes and summary tables in a warehouse. Proceedings of the ACM International Conference on Data (SIGMOD'97), 100-111.]]
[27]
Pendse, N., & Creeth, R. The OLAP Report. http://www.olapreport.com/ Analyses.htm. Parts available on-line in the current edition.]]
[28]
Poon, C.K. (2001). Orthogonal range queries in OLAP. Proceedings of the International Conference on Database Theory (ICDT'01), 361-374.]]
[29]
Riedewald, M., Agrawal, D., & El Abbadi, A. (2000). pCube: Update-efficient online aggregation with progressive feedback and error bounds. Proceedings of the 12th International Conference on Scientific and Statistical Data-base Management (SSDBM'00), 95-108.]]
[30]
Riedewald, M., Agrawal, D., & El Abbadi, A. (2001). Flexible data cubes for online aggregation. Proceedings of the International Conference on Database Theory (ICDT'01), 159-173.]]
[31]
Riedewald, M., Agrawal, D., El Abbadi, A., & Pajarola, R. (2000). Space-efficient data cubes for dynamic environments. Proceedings of the International Conference on Data Warehousing and Knowledge Discovery DaWaK, 24-33.]]
[32]
Roussopoulos, N., Kotidis, Y., & Roussopoulos, M. (1997). Cubetree: Organization of and bulk updates on the data cube. Proceedings of the ACM International Conference on Management of Data (SIGMOD'97), 89-99.]]
[33]
Sarawagi, S., & Stonebraker, M. (1994). Efficient organization of large multidimensional arrays. Proceedings of the International Conference on Data Engineering (ICDE'94), 328-336.]]
[34]
Shukla, A., Deshpande, P., & Naughton, J.F. (2000). Materialized view selection for multi-cube data models. Proceedings of the International Conference on Extending Database Technology (EDBT'00), 269-84.]]
[35]
Smith, J.R., Castelli, V., Jhingran, A., & Li, C.-S. (1998). Dynamic assembly of views in data cubes. Symposium on Principles of Database Systems, PODS'98, 274-283.]]
[36]
Willard, D.E. (1986). Lower bounds for dynamic range query problems that permit subtraction. Proceedings of the International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, No. 226. Springer-Verlag, 444-453.]]
[37]
Willard, D.E., & Lueker, G.S. (1985 ). Adding range restriction capability to dynamic data structures. Journal of the ACM, 32(3), 597-617.]]
[38]
Winter Corporation. (2001). Database Scalability Program, 2001. Results available on-line at http://www.wintercorp.com.]]
Recommendations
A Join-Like Operator to Combine Data Cubes and Answer Queries from Multiple Data Cubes
In order to answer a “joint” query from multiple data cubes, Pourabass and Shoshani [2007] distinguish the data cube on the measure of interest (called the “primary” data cube) from the other data cubes (called “proxy” data cubes) that are used to ...
Space-Efficient Data Cubes for Dynamic Environments
DaWaK 2000: Proceedings of the Second International Conference on Data Warehousing and Knowledge DiscoveryData cubes provide aggregate information to support the analysis of the contents of data warehouses and databases. An important tool to analyze data in data cubes is the range query. For range queries that summarize large regions of massive data cubes, ...
Comments
Information & Contributors
Information
Published In
Publisher
IGI Global
United States
Publication History
Published: 01 January 2003
Qualifiers
- Chapter
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Oct 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in