The Polynomial Complexity of Fully Materialized Coalesced Cubes

Proceedings 2004 VLDB Conference: The 30th International Conference on Very Large Databases (VLDB)

Volumn , Issue , 2004, Pages 540-551

  Sismanis, Yannis ^a   Roussopoulos, Nick ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84858023828     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1016/B978-012088469-8.50049-8     Document Type: Chapter

References (21)

1. S. Acharya, P.B. Gibbons and V. Poosala (2000) Congressional Samples for Approximate Answering of Group-By Queries. SIGMOD Dallas, Texas 487-498.
2. S. Agarwal, R. Agrawal, P. M. Deshpande, A. Gupta, J. F. Naughton, R. Ramakrishnan, and S. Sarawagi. On the computation of multidimensional aggregates. In VLDB, pages 506–521, 1996.
3. K. Beyer and R. Ramakrishnan (1999) Bottom-Up Computation of Sparse and Iceberg CUBEs. SIGMOD Philadelphia, PA, USA 359-370.
4. P.M. Deshpande, S. Agarwal, J.F. Naughton and R. Ramakrishnan (1996) Computation of multidimensional aggregates. Technical Report 1314 University of Wisconsin-Madison
5. Lixin Fu and Joachim Hammer. CUBIST: A New Algorithm for Improving the Performance of Ad-hoc OLAP Queries. In DOLAP, 2000.
6. J. Gray, A. Bosworth, A. Layman and H. Pirahesh (February 1996) Data Cube: A Relational Aggregation Operator Generalizing Gro up-By, Cross-Tab, and Sub-Totals. ICDE New Orleans IEEE 152-159.
7. H. Gupta, V. Harinarayan, A. Rajaraman and J. Ullman (April 1997) Index Selection for OLAP. ICDE Burmingham, UK 208-219.
8. V. Harinarayan, A. Rajaraman and J. Ullman (June 1996) Implementing Data Cubes Efficiently. SIGMOD Montreal, Canada 205-216.
9. T. Johnson and D. Shasha (March 1997) Some Approaches to Index Design for Cube Forests. Data Engineering Bulletin 20(1), 27-35.
10. H.J. Karloff and M. Mihail (May 1999) On the Complexity of the View-Selection Problem. PODS Philadelphia, Pennsylvania 167-173.
11. L. Lakshmanan, J. Pei and Y. Zhao Yan (2003) QC-Trees: An Efficient Summary Structure for Semantic OLAP. SIGMOD San Diego, California 64-75.
12. K. A. Ross and D. Srivastana. Fast Computation of Sparse Datacubes. In VLDB, pages 116–125, Athens, Greece, 1997.
13. N. Roussopoulos, Y. Kotidis and M. Roussopoulos (May 1997) Cubetree: Organization of and Bulk Incremental Updates on the Data Cube. SIGMOD Tucson, Arizona 89-99.
14. S. Sarawagi, R. Agrawal and A. Gupta (1996) On computing the data cube. Technical Report RJ10026 San Jose, CA: IBM Almaden Research Center
15. A. Shukla, P. Deshpande, J. Naughton, and K. Ramasamy. Storage estimation for multidimensional aggregates in the presense of hierarchies. In VLDB, pages 522–531, Bombay, India, August 1996.
16. Y. Sismanis, A. Deligiannakis, Y. Kotidis, and N. Roussopoulos. Hierarchical dwarfs for the rollup cube. In DOLAP, 2003.
17. Y. Sismanis, A. Deligiannakis, N. Roussopoulos and Y. Kotidis (2002) Dwarf: Shrinking the PetaCube. SIGMOD Madison, Wisconsin 464-475.
18. D. Theodoratos and T. Sellis. Data Warehouse Configuration. In VLDB, pages 126–135, Athens, Greece, August 1997.
19. J.S. Vitter, M. Wang, and B. Iyer. Data Cube Approximation and Histograms via Wavelets. In CIKM, 1998.
20. W. Wang Wei, H. Lu Hongjun, J. Feng Jianlin and J.X. Yu Jeffrey Xu (2002) Condensed Cube: An Effective Approach to Reducing Data Cube Size. ICDE
21. Y. Zhao, P.M. Deshpande and J.F. Naughton (1997) An array-based algorithm for simultaneous multidimensional aggregates. SIGMOD 159-170.