Efficient Computation of Iceberg Quotient Cube by Bounding
暂无分享,去创建一个
Chen Luo | Yongqing Zheng | Xinbao Wang | Fang Teng | Xinbao Wang | Yongqing Zheng | Chen Luo | Fang Teng
[1] Hongyan Liu,et al. C-Cubing: Efficient Computation of Closed Cubes by Aggregation-Based Checking , 2006, 22nd International Conference on Data Engineering (ICDE'06).
[2] Laks V. S. Lakshmanan,et al. Quotient Cube: How to Summarize the Semantics of a Data Cube , 2002, VLDB.
[3] Raghu Ramakrishnan,et al. Bottom-up computation of sparse and Iceberg CUBE , 1999, SIGMOD '99.
[4] Laks V. S. Lakshmanan,et al. QC-trees: an efficient summary structure for semantic OLAP , 2003, SIGMOD '03.
[5] Jiawei Han,et al. Star-Cubing: Computing Iceberg Cubes by Top-Down and Bottom-Up Integration , 2003, Very Large Data Bases Conference.
[6] Xiuzhen Zhang,et al. Efficient Computation of Iceberg Cubes by Bounding Aggregate Functions , 2007, IEEE Transactions on Knowledge and Data Engineering.
[7] RamakrishnanRaghu,et al. Bottom-up computation of sparse and Iceberg CUBE , 1999 .
[8] Jian Pei,et al. Efficient computation of Iceberg cubes with complex measures , 2001, SIGMOD '01.
[9] Jiawei Han,et al. MM-Cubing: computing Iceberg cubes by factorizing the lattice space , 2004, Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004..