Dwarf: Shrinking the PetaCube

Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, SIGMOD 2002

Volumn , Issue , 2002, Pages 464-475

  Sismanis, Yannis ^a   Deligiannakis, Antonios ^a   Roussopoulos, Nick ^a   Kotidis, Yannis ^b  

^a Dept of Computer Science ^*  (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL STORAGE; FLOCCULATION; GEOMETRY; QUERY PROCESSING;

% REDUCTIONS; DATA CUBE; DWARF CUBES; EXPONENTIALS; FACT TABLES; HIGH-DIMENSIONAL; HIGHER-DIMENSIONAL; SPARSE AREAS; STRUCTURAL FACTOR; STRUCTURAL REDUNDANCY;

REDUNDANCY;

EID: 85134307901     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/564691.564745     Document Type: Conference Paper

References (29)

1. [AAD +] S. Agarwal, R. Agrawal, P. M. Deshpande, A. Gupta, J .E Naughton, R. Ramakrishnan, and S. Sarawagi. On the computation of multidimensional aggregates. In VLDB 1996.
2. [AGP] S. Acharya, P. B. Gibbons, V. Poosala. Congressional Samples for Approximate Answering of Group-By Queries. In SIGMOD 2000, Dallas
3. [Bla] Jock A. Blackard. The Forest CoverType Dataset. fip://ftp.ics.uci.edu/pub/machine-learningdatabases/covtype.
4. [BPT] E. Baralis, S. Paraboschi, and E. Teniente. Materialized View Selection in a Multidimensional Database. In VLDB 1997, Athens.
5. [BR] K.S. Beyer and R. Ramakrishnan. Bottom-Up Computation of Sparse and Iceberg CUBEs. In SIGMOD 1999, Philadelphia.
6. [BS98] D. Barbara and M. Sullivan. A Space-Efficient way to support Approximate Multidimensional Databases. Technical report, ISSE-TR-98-03, George Mason University, 1998.
7. [Cou98] Olap Council. APB-1 Benchmark. http://www.olapcouncil.org/research/bmarkco.htm 1998
8. [DANR96] P.M. Deshpande, S. Agarwal, J.E Naughton, R. Ramakrishnan. Computation of multidimensional aggregates. Technical Report 1314 University of Wisconsin -Madison 1996
9. L. Fu and J. Hammer. CUBIST: A New Algorithm for Improving the Performance ofAd-hoc OLAP Queries. In DOLAP, 2000.
10. M. Fang, N. Shivaknmar, H. Garcia-Molina, R. Motwani, and J.D. Ullman. Computing Iceberg Queries Efficiently. In VLDB 1998.
11. J. Gray, A. Bosworth, A. Layman, and H. Pirahesh. Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals. In ICDE 1996, New Orleans. IEEE.
12. H. Gupta, V. Harinarayan, A. Rajaraman, and J. Ullman. Index Selection for OLAP. In ICDE 1997, Burmingham.
13. P. B. Gibbons and Y. Matias. New Sampling-Based Summary Statistics for Improving Approximate Query Answers. In SIGMOD 1998, Seattle
14. H. Gupta. Selections of Views to Materialize in a Data Warehouse. In ICDT 1997, Delphi.
15. J.M. Hellerstein, P.J. Haas, and H. Wang. Online Aggregation. In SIGMOD 1997, Tucson.
16. V. Harinarayan, A. Rajaraman, and J. Ullman. Implementing Data Cubes Efficiently. In SIGMOD 1996, Montreal.
17. C. Hahn, S. Warren, and J. London. Edited synoptic cloud reports from ships and land stations over the globe. http://cdiac.esd.oml.gov/cdiac/ndps/ndpO26b.html.
18. T. Johnson and D. Shasha. Some Approaches to Index Design for Cube Forests. Data Engineering Bulletin, 20(1), March 1997.
19. Y. Kotidis and N. Roussopoulos. An Alternative Storage Organization for ROLAP Aggregate Views Based on Cubetrees. In SIGMOD 1998, Seattle.
20. N. Roussopoulos, Y. Kotidis, and M. Roussopoulos. Cubetree: Organization of and Bulk Incremental Updates on the Data Cube. In SIGMOD 1997, Tucson.
21. K. A. Ross and D. Srivastana. Fast Computation of Sparse Datacubes. In VLDB 1997, pages 116-125, Athens, Greece.
22. N. Roussopoulos, J. Sismanis, A. Deligiannakis, and Y. Kotidis. The Dwarf Structure for Creating, Storing, and Querying Highly Compressed Data Cubes. Application to U.S. patent office submitted, June 2001.
23. S. Sarawagi, R. Agrawal, and A. Gupta. On computing the data cube. Technical Report RJ 10026, IBM Almaden Research Center, San Jose, CA, 1996.
24. A. Shukla, P.M. Deshpande, and J.F. Naughton. Materialized View Selection for Multidimensional Datasets. In VLDB 1998, New York City.
25. Y. Sismanis, A. Deligiannakis, N. Roussopoulos, and Y. Kotidis. Dwarf: Shrinking the PetaCube. Technical Report CS-TR 4342, University of Maryland, College Park, February 2002.
26. J. Shanmugasundaram, U. Fayyad, and P.S. Bradley. Compressed Data Cubes for OLAP Aggregate Query Approximation on Continuous Dimensions. In KDD 1999.
27. J.S Vitter, M. Wang, and B. Iyer. Data Cube Approximation and Histograms via Wavelets. In CIKM 1998.
28. W. Wang, H. Lu, J. Feng, and J. Xu Yu. Condensed Cube: An Effective Approach to Reducing Data Cube Size. In ICDE, 2002.
29. Y. Zhao, E M. Deshpande, and J. E Naughton. An array-based algorithm for simultaneous multidimensional aggregates. In SIGMOD 1997.