
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Dong Xin, Jiawei Han, Xiaolei Li, Zheng Shao, Benjamin W. Wah, "Computing Iceberg Cubes by TopDown and BottomUp Integration: The StarCubing Approach," IEEE Transactions on Knowledge and Data Engineering, vol. 19, no. 1, pp. 111126, January, 2007.  
BibTex  x  
@article{ 10.1109/TKDE.2007.4, author = {Dong Xin and Jiawei Han and Xiaolei Li and Zheng Shao and Benjamin W. Wah}, title = {Computing Iceberg Cubes by TopDown and BottomUp Integration: The StarCubing Approach}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {19}, number = {1}, issn = {10414347}, year = {2007}, pages = {111126}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2007.4}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Computing Iceberg Cubes by TopDown and BottomUp Integration: The StarCubing Approach IS  1 SN  10414347 SP111 EP126 EPD  111126 A1  Dong Xin, A1  Jiawei Han, A1  Xiaolei Li, A1  Zheng Shao, A1  Benjamin W. Wah, PY  2007 KW  Data warehouse KW  data mining KW  online analytical processing (OLAP). VL  19 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] S. Agarwal, R. Agrawal, P.M. Deshpande, A. Gupta, J.F. Naughton, R. Ramakrishnan, and S. Sarawagi, “On the Computation of Multidimensional Aggregates,” Proc. Int'l Conf. Very Large Data Bases (VLDB '96), pp. 506521, Sept. 1996.
[2] R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules,” Proc. Int'l Conf. Very Large Data Bases (VLDB '94), pp. 487499, Sept. 1994.
[3] E. Baralis, S. Paraboschi, and E. Teniente, “Materialized View Selection in a Multidimensional Database,” Proc. Int'l Conf. Very Large Data Bases (VLDB '97), pp. 9812, Aug. 1997.
[4] D. Barbara and M. Sullivan, “QuasiCubes: Exploiting Approximation in Multidimensional Databases,” SIGMOD Record, vol. 26, pp. 1217, 1997.
[5] D. Barbará and X. Wu, “Using Loglinear Models to Compress Datacube,” Proc. First Int'l Conf. WebAge Information Management (WAIM '00), pp. 311322, 2000.
[6] K. Beyer and R. Ramakrishnan, “BottomUp Computationn of Sparse and Iceberg Cubes,” Proc. ACMSIGMOD Int'l Conf. Management of Data (SIGMOD '99), pp. 359370, June 1999.
[7] Y. Chen, G. Dong, J. Han, B.W. Wah, and J. Wang, “Multidimensional Regression Analysis of TimeSeries Data Streams,” Proc. 2002 Int'l Conf. Very Large Data Bases (VLDB '02), pp. 323334, Aug. 2002.
[8] Z. Chen and V. Narasayya, “Efficient Computation of Multiple Group by Queries,” Proc. ACMSIGMOD Int'l Conf. Management of Data (SIGMOD '05), pp. 263274, June 2005.
[9] J. Gray, S. Chaudhuri, A. Bosworth, A. Layman, D. Reichart, M. Venkatrao, F. Pellow, and H. Pirahesh, “Data Cube: A Relational Aggregation Operator Generalizing GroupBy, CrossTab and SubTotals,” Data Mining and Knowledge Discovery, vol. 1, pp. 2954, 1997.
[10] H. Gupta, “Selection of Views to Materialize in a Data Warehouse,” Proc. Seventh Int'l Conf. Database Theory (ICDT '97), pp. 98112, Jan. 1997.
[11] H. Gupta, V. Harinarayan, A. Rajaraman, and J.D. Ullman, “Index Selection for OLAP,” Proc. Int'l Conf. Data Eng. (ICDE '97), pp. 208219, Apr. 1997.
[12] J. Han and M. Kamber, Data Mining: Concepts and Techniques. Morgan Kaufmann, 2001.
[13] J. Han, J. Pei, G. Dong, and K. Wang, “Efficient Computation of Iceberg Cubes with Complex Measures,” Proc. ACMSIGMOD Int'l Conf. Management of Data (SIGMOD '01), pp. 112, May 2001.
[14] J. Han, J. Pei, and Y. Yin, “Mining Frequent Patterns without Candidate Generation,” Proc. ACMSIGMOD Int'l Conf. Management of Data (SIGMOD '00), pp. 112, May 2000.
[15] V. Harinarayan, A. Rajaraman, and J.D. Ullman, “Implementing Data Cubes Efficiently,” Proc. ACMSIGMOD Int'l Conf. Management of Data (SIGMOD '96), pp. 205216, June 1996.
[16] T. Imielinski, L. Khachiyan, and A. Abdulghani, “Cubegrades: Generalizing Association Rules,” Data Mining and Knowledge Discovery, vol. 6, pp. 219258, 2002.
[17] L.V.S. Lakshmanan, J. Pei, and J. Han, “Quotient Cube: How to Summarize the Semantics of a Data Cube,” Proc. Int'l Conf. Very Large Data Bases (VLDB '02), pp. 778789, Aug. 2002.
[18] L.V. S. Lakshmanan, J. Pei, and Y. Zhao, “QCTrees: An Efficient Summary Structure for Semantic OLAP,” Proc. ACMSIGMOD Int'l Conf. Management of Data (SIGMOD '03), pp. 6475, June 2003.
[19] X. Li, J. Han, and H. Gonzalez, “HighDimensional OLAP: A Minimal Cubing Approach,” Proc. Int'l Conf. Very Large Data Bases (VLDB '04), pp. 528539, Aug. 2004.
[20] R. Ng, L.V.S. Lakshmanan, J. Han, and A. Pang, “Exploratory Mining and Pruning Optimizations of Constrained Associations Rules,” Proc. ACMSIGMOD Int'l Conf. Management of Data (SIGMOD '98), pp. 1324, June 1998.
[21] K. Ross and D. Srivastava, “Fast Computation of Sparse Datacubes,” Proc. Int'l Conf. Very Large Data Bases (VLDB '97), pp. 116125, Aug. 1997.
[22] S. Sarawagi, R. Agrawal, and N. Megiddo, “DiscoveryDriven Exploration of OLAP Data Cubes,” Proc. Int'l Conf. Extending Database Technology (EDBT '98), pp. 168182, Mar. 1998.
[23] J. Shanmugasundaram, U.M. Fayyad, and P.S. Bradley, “Compressed Data Cubes for OLAP Aggregate Query Approximation on Continuous Dimensions,” Proc. Int'l Conf. Knowledge Discovery and Data Mining (KDD '99), pp. 223232, Aug. 1999.
[24] A. Shukla, P.M. Deshpande, and J.F. Naughton, “Materialized View Selection for Multidimensional Datasets,” Proc. Int'l Conf. Very Large Data Bases (VLDB '98), pp. 488499, Aug. 1998.
[25] Y. Sismanis and N. Roussopoulos, “The Complexity of Fully Materialized Coalesced Cubes,” Proc. Int'l Conf. Very Large Data Bases (VLDB '04), pp. 540551, Aug. 2004.
[26] Y. Sismanis, N. Roussopoulos, A. Deligianannakis, and Y. Kotidis, “Dwarf: Shrinking the Petacube,” Proc. ACMSIGMOD Int'l Conf. Management of Data (SIGMOD '02), pp. 464475, June 2002.
[27] J.S. Vitter, M. Wang, and B.R. Iyer, “Data Cube Approximation and Histograms Via Wavelets,” Proc. Int'l Conf. Information and Knowledge Management (CIKM '98), pp. 96104, Nov. 1998.
[28] W. Wang, H. Lu, J. Feng, and J.X. Yu, “Condensed Cube: An Effective Approach to Reducing Data Cube Size,” Proc. Int'l Conf. Data Eng. (ICDE '02), pp. 155165, Apr. 2002.
[29] D. Xin, Z. Shao, J. Han, and H. Liu, “CCubing: Efficient Computation of Closed Cubes by AggregationBased Checking,” Proc. Int'l Conf. Data Eng. (ICDE '06), p. 4, Apr. 2006.
[30] Y. Zhao, P.M. Deshpande, and J.F. Naughton, “An ArrayBased Algorithm for Simultaneous Multidimensional Aggregates,” Proc. ACMSIGMOD Int'l Conf. Management of Data (SIGMOD '97), pp.159170, May 1997.