Range CUBE: Efficient cube computation by exploiting data correlation

Proceedings - International Conference on Data Engineering

Volumn 20, Issue , 2004, Pages 658-669

  Feng, Ying ^a   Agrawal, Divyakant ^a   El Abbadi, Amr ^a   Metwally, Ahmed ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COSTS; DATA CUBE COMPUTATION; DATA SPARSITY; HOLISTIC FUNCTION; MINING TECHIQUES;

ALGORITHMS; COMPUTATIONAL METHODS; DATA STRUCTURES; DECISION SUPPORT SYSTEMS; INTEGRATION; NUMERICAL ANALYSIS; QUERY LANGUAGES; SEMANTICS;

DATA WAREHOUSES;

EID: 2442586458     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. Int. Conf. on Very Large Databases (VLDB), pages 487-499, 1994.
2. D. Barbara and M. Sullivan. Quasi-cubes: Exploiting approximation in multidimensional databases. In Proc. Int. Conf. on Management of Data (SIGMOD), pages 12-17, 1997.
3. D. Barbara and X. Wu. Using loglinear models to compress data cubes. In Proc. Int. Conf. on Web Age Information Systems (WAIM 2000), pages 311-322, 2000.
4. K. Beyer and R. Ramakrishnan. Bottom-up computation of sparse and iceberg cubes. In Proc. Int. Conf. on Management of Data (SIGMOD), pages 359-370, 1999.
5. G. Birkhoff. Lattice Theory. American Mathematical Society, 1967.
6. M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motwani, and J. D. Ullman. Computing iceberg queries efficiently. In Proc. Int. Conf. on Very Large Databases (VLDB), pages 299-310, 1998.
7. J. Gray, A. Bosworth, A. Layman, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. In Proc. Int. Conf. on Data Engineering (ICDE), pages 152-159, 1996.
8. C. Hahn. Edited synoptic cloud reports from ships and land stations over the globe, 1982-1991. cdiac.est.ornl.gov/ftp/ndp026b/SEP85L.Z, 1994.
9. Jiawei Han, Jian Pei, Guozhu dong, and Ke Wang. Efficient computation of iceberg cubes with complex measures. In Proc. Int. Conf. on Management of Data (SIGMOD), pages 1-12, 2001.
10. L. V. S. Lakshmanan, J. Pei, and J. Han. Quotient cube: How to summarize the semantics of a data cube. In Proc. Int. Conf. on Very Large Database (VLDB), pages 766-777, 2002.
11. Laks V. S. Lakshmanan, P. Jian, and Y. Zhao. Qc-trees: An efficient summary structure for semantic olap. In Proc. Int. Conf. on Management of Data (SIGMOD), pages 64-75, 2003.
12. K. A. Ross and D. Srivastana. Fast computation of sparse datacubes. In Proc. Int. Conf. on Very Large Database (VLDB), pages 116-125, 1997.
13. J. Shanmugasundaram, U. Fayyad, and PS Bradley. Compressed data cubes for olap aggregate query approximation on continuous dimensions. In Knowledge Discovery and Data Mining, pages 223-232, 1999.
14. Y. Sismanis, A. Deligiannakis, N. Roussopoulos, and Y. Kotidis. Dwarf: Shrinking the petacube. In Proc. Int. Conf. on Management of Data (SIGMOD), pages 464-475, 2002.
15. W. Wang, J. Feng, H. Lu, and J. Yu. Condensed cube: An effective approach to reducing data cube size. In Proc. Int. Conf. on Data Engineering (ICDE), pages 155-165, 2002.
16. D. Xin, J. Han, X. Li, and B. Wan. Star-cubing: Computing iceberg cubes by top-down and bottom-up integration. In Proc. Int. Conf. on Very Large Databases (VLDB), pages 476-487, 2003.
17. Y. Zhao, P. M. Deshpande, and J. F. Naughton. An array-based algorithm for simultaneous multidimensional aggregates. In Proc. Int. Conf. on Management of Data (SIGMOD), pages 150-170, 1997.
18. G.K. Zipf. Human Behavior and The Principle of Least Effort. Addison-Wesley, 1949.