An efficient method for maintaining data cubes incrementally

Information Sciences

Volumn 180, Issue 6, 2010, Pages 928-948

  Lee, Ki Yong ^a   Chung, Yon Dohn ^b   Kim, Myoung Ho ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b Korea University   (South Korea)

Author keywords

Data cube; Data warehouse; Materialized view; OLAP

Indexed keywords

CONVENTIONAL METHODS; DATA CUBE; DIMENSION HIERARCHIES; EFFICIENT METHOD; HEURISTIC SOLUTIONS; INCREMENTAL MAINTENANCE; MAINTENANCE COST; MATERIALIZED VIEW; OPTIMAL SUBSETS; OPTIMIZATION PROBLEMS;

COST REDUCTION; GEOMETRY; MAINTENANCE;

DATA WAREHOUSES;

EID: 73149085051     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2009.11.037     Document Type: Article

References (35)

1. S. Agarwal, R. Agrawal, P.M. Deshpande, A. Gupta, J.F. Naughton, R. Ramakrishnan, S. Sarawagi, On the computation of multidimensional aggregates, in: Proceedings of the 22nd International Conference on Very Large Data Bases, 1996, pp. 506-521.
2. K. Beyer, R. Ramakrishnan, Bottom-up computation of sparse and iceberg CUBEs, in: Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data, 1999, pp. 359-370.
3. S. Chaudhuri, K. Shim, Including group-by in query optimization, in: Proceedings of the 20th International Conference on Very Large Data Bases, 1994, pp. 354-366.
4. S. Chen, E.A. Rundensteiner, GPIVOT: efficient incremental maintenance of complex ROLAP views, in: Proceedings of the 21st International Conference on Data Engineering, 2005, pp. 552-563.
5. Z. Chen, V. Narasayya, Efficient computation of multiple group by queries, in: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, 2005, pp. 263-274.
6. Y. Feng, D. Agrawal, A.E. Abbadi, A. Metwally, Range CUBE: efficient cube computation by exploiting data correlation, in: Proceedings of the 20th International Conference on Data Engineering, 2004, pp. 658-670.
7. Foulds L.R., and Graham R.L. The Steiner problem in phylogeny is NP-complete. Advances in Applied Mathematics 3 (1982) 43-49
8. Garey M.R., and Johnson D.S. Computers and Intractability (1979), W.H. Freeman, San Francisco
9. Graefe G. Query evaluation techniques for large databases. ACM Computing Surveys 25 2 (1993) 73-169
10. Gray J., Chaudhuri S., Bosworth A., Layman A., Reichart D., Venkatrao M., Pellow F., and Pirahesh H. Data cube: a relational aggregation operator generalizing group-by, cross-tab, and sub-total. Data Mining and Knowledge Discovery 1 1 (1997) 29-53
11. Griffin T.G., Libkin L., and Trickey H. An improved algorithm for the incremental recomputation of active relational expressions. IEEE Transactions on Knowledge and Data Engineering 9 3 (1997) 508-511
12. Gupta H., and Mumick I.S. Incremental maintenance of aggregate and outerjoin expressions. Information Systems 31 6 (2006) 435-464
13. Hung M., Huang M., Yang D., and Hsueh N. Efficient approaches for materialized views selection in a data warehouse. Information Sciences 177 6 (2007) 1333-1348
14. C.A. Hurtado, A.O. Mendelzon, A.A. Vaisman, Maintaining data cubes under dimension updates, in: Proceedings of the 15th International Conference on Data Engineering, 1999, pp. 346-355.
15. P. Haas, J. Naughton, S. Seshadri, L. Stokes, Sampling-based estimation of the number of distinct values of an attribute, in: Proceedings of the 21st International Conference on Very Large Data Bases, 1995, pp. 311-322.
16. J. Han, J. Pei, G. Dong, K. Wang. Efficient computation of iceberg cubes with complex measures, in: Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data, 2001, pp. 1-12.
17. V. Harinarayan, A. Rajaraman, J.D. Ullman, Implementing data cubes efficiently, in: Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, 1996, pp. 205-216.
18. Kotidis Y. Aggregate view management in data warehouses. Handbook of Massive Data Sets (2002) 711-741
19. L. Lakshmanan, J. Pei, J. Han, Quotient cube: how to summarize the semantics of a data cube, in: Proceedings of the 28th International Conference on Very Large Data Bases, 2002, pp. 778-789.
20. L. Lakshmanan, A. Russakovsky, V. Sashikanth, What-if OLAP queries with changing dimensions, in: Proceedings of the 24th International Conference on Data Engineering, 2008, pp. 1334-1336.
21. Lechtenborger J., and Vossen G. Multidimensional normal forms for data warehouse design. Information Systems 28 5 (2003) 415-434
22. K.Y. Lee, M.H. Kim, Efficient incremental maintenance of data cubes, in: Proceedings of the 32nd International Conference on Very Large Data Bases, 2006, pp. 823-833.
23. W. Lehner, R. Sidle, H. Pirahesh, R. Cochrane, Maintenance of cube automatic summary tables, in: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, 2000, pp. 512-513.
24. H. Lenz, A. Shoshani, Summarizability in OLAP and statistical data bases, in: Proceedings of the Ninth International Conference on Scientific and Statistical Database Management, 1997, pp. 132-143.
25. Liu Y., Hsu P., Sheen G., Ku S., and Chang K. Simultaneous determination of view selection and update policy with stochastic query and response time constraints. Information Sciences 178 18 (2008) 3491-3509
26. I.S. Mumick, D. Quass, B.S. Mumick, Maintenance of data cubes and summary tables in a warehouse, in: Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data, 1997, pp. 100-111.
27. Oracle Corporation, Oracle Database 11g, , 2008.
28. Papadimitriou C.H., and Steiglitz K. Combinatorial Optimization: Algorithms and Complexity (1998), Dover, New York
29. K.A. Ross, D. Srivastava, Fast computation of sparse datacubes, in: Proceedings of the 23rd International Conference on Very Large Data Bases, 1997, pp. 116-125.
30. Y. Sismanis, A. Deligiannakids, No. Roussopoulos, Y. Kotidis, Dwarf: shrinking the petacube, in: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, 2002, pp. 464-475.
31. Y. Sismanis, N. Roussopoulos, The complexity of fully materialized coalesced cubes, in: Proceedings of the 30th International Conference on Very Large Data Bases, 2004, pp. 540-551.
32. TPC Committee, The TPC Benchmark-H, , 2008.
33. W. Wang, J. Feng, H. Lu, J.X. Yu, Condensed cube: an effective approach to reducing data cube size, in: Proceedings of the 18th International Conference on Data Engineering, 2002, pp. 155-165.
34. Xin D., Han J., Li X., Shao Z., and Wah B.W. Computing iceberg cubes by top-down and bottom-up integration: the StarCubing approach. IEEE Transactions on Knowledge and Data Engineering 19 1 (2007) 111-126
35. D. Xin, Z. Shao, J. Han, H. Liu, C-cubing: efficient computation of closed cubes by aggregation-based checking, in: Proceedings of the 22nd International Conference on Data Engineering, 2006, pp. 4-13.