1. E. Baralis, S. Paraboschi, and E. Teniente. Materialized view selection in a multidimensional database. InProc. Int. Conf. on Very Large Databases (VLDB), pages 156–165, 1997.

   Google Scholar 

2. K. Beyer and R. Ramakrishnan. Bottom-up computation of sparse and iceberg CUBEs. InProc. Int. Conf. on Management of Data (SIGMOD), pages 359–370, 1999.

   Google Scholar 

3. C.-Y. Chan and Y. E. Ioannidis. Hierarchical cubes for range-sum queries. InProc. Int. Conf. on Very Large Databases (VLDB), pages 675–686, 1999. Extended version published as Tech. Report, Univ. of Wisconsin, 1999.

   Google Scholar 

4. E. F. Codd. Providing OLAP (on-line analytical processing) to user-analysts: An IT mandate. Technical report, E. F. Codd and Associates, 1993.

   Google Scholar 

5. S. Geffner, D. Agrawal, and A. El Abbadi. The dynamic data cube. InProc. Int. Conf. on Extending Database Technology (EDBT), pages 237–253, 2000.

   Google Scholar 

6. S. Geffner, D. Agrawal, A. El Abbadi, and T. Smith. Relative prefix sums: An efficient approach for querying dynamic OLAP data cubes. InProc. Int. Conf. on Data Engineering (ICDE), pages 328–335, 1999.

   Google Scholar 

7. J. Gray, S. Chaudhuri, A. Bosworth, A. Layman, D. Reichart, M. Venkatrao, F. Pellow, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals.Data Mining and Knowledge Discovery, pages 29–53, 1997.

   Google Scholar 

8. H. Gupta. Selection of views to materialize in a data warehouse. InProc. Int. Conf. on Database Theory (ICDT), pages 98–112, 1997.

   Google Scholar 

9. H. Gupta, V. Harinarayan, A. Rajaraman, and J. D. Ullman. Index selection for OLAP. InProc. Int. Conf. on Data Engineering (ICDE), pages 208–219, 1997.

   Google Scholar 

10. V. Harinarayan, A. Rajaraman, and J. D. Ullman. Implementing data cubes efficiently. InProc. Int. Conf. on Management of Data (SIGMOD), pages 205–216, 1996.

    Google Scholar 

11. C. Ho, R. Agrawal, N. Megiddo, and R. Srikant. Range queries in OLAP data cubes. InProc. Int. Conf. on Management of Data (SIGMOD), pages 73–88, 1997.

    Google Scholar 

12. T. Johnson and D. Shasha. Some approaches to index design for cube forests.IEEE Data Engineering Bulletin, 20(1):27–35, 1997.

    Google Scholar 

13. Y. Kotidis and N. Roussopoulos. An alternative storage organization for ROLAP aggregate views based on cubetrees. InProc. Int. Conf. on Management of Data (SIGMOD), pages 249–258, 1998.

    Google Scholar 

14. N. Pendse and R. Creeth. The OLAP report.http://www.olapreport.com/Analyses.htm, 2000. Parts available online in the current edition.

15. M. Riedewald, D. Agrawal, and A. El Abbadi. Flexible data cubes for online aggregation. Technical report, UC Santa Barbara, 2000.

    Google Scholar 

16. M. Riedewald, D. Agrawal, and A. El Abbadi. pCube: Update-efficient online aggregation with progressive feedback and error bounds. InProc. Int. Conf. on Scientific and Statistical Database Management (SSDBM), pages 95–108, 2000.

    Google Scholar 

17. M. Riedewald, D. Agrawal, A. El Abbadi, and R. Pajarola. Space-efficient data cubes for dynamic environments. InProc. Int. Conf. on Data Warehousing and Knowledge Discovery (DaWaK), pages 24–33, 2000.

    Google Scholar 

18. J. R. Smith, V. Castelli, A. Jhingran, and C.-S. Li. Dynamic assembly of views in data cubes. InProc. Symp. on Principles of Database Systems (PODS), pages 274–283, 1998.

    Google Scholar 

19. J. S. Vitter and M. Wang. Approximate computation of multidimensional aggregates of sparse data using wavelets. InProc. Int. Conf. on Management of Data (SIGMOD), pages 193–204, 1999.

    Google Scholar 

20. J. S. Vitter, M. Wang, and B. Iyer. Data cube approximation and histograms via wavelets. InProc. Intl. Conf. on Information and Knowledge Management (CIKM), pages 96–104, 1998.

    Google Scholar 

Download references