A Closed Frag-Shells Cubing Algorithm on High Dimensional and Non-Hierarchical Data Sets
暂无分享,去创建一个
[1] Hamid Pirahesh,et al. Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals , 1996, Data Mining and Knowledge Discovery.
[2] RamakrishnanRaghu,et al. Bottom-up computation of sparse and Iceberg CUBE , 1999 .
[3] Yannis Sismanis,et al. Dwarf: shrinking the PetaCube , 2002, SIGMOD '02.
[4] Jeffrey F. Naughton,et al. On the Computation of Multidimensional Aggregates , 1996, VLDB.
[5] Yannis E. Ioannidis,et al. Bitmap index design and evaluation , 1998, SIGMOD '98.
[6] Zhu Ka. Computation of Data Dube in Analysis of Water Census Results , 2014 .
[7] Mario A. Nascimento,et al. Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 , 2004 .
[8] Raghu Ramakrishnan,et al. Bottom-up computation of sparse and Iceberg CUBE , 1999, SIGMOD '99.
[9] Jiawei Han,et al. High-Dimensional OLAP: A Minimal Cubing Approach , 2004, VLDB.
[10] Jianguo Yao,et al. Frag-shells cube based on hierarchical dimension encoding tree , 2017, IMCOM.
[11] Hongjun Lu,et al. Condensed cube: an effective approach to reducing data cube size , 2002, Proceedings 18th International Conference on Data Engineering.
[12] Ye Xu,et al. Minimal Condensed Cube: Data Organization, Fast Computation, and Incremental Update , 2008, 2008 International Conference on Internet Computing in Science and Engineering.
[13] Jianqing Xi,et al. CCBitmaps: A Space-Time Efficient Index Structure for OLAP , 2009, ADMA.
[14] Arie Shoshani,et al. Breaking the Curse of Cardinality on Bitmap Indexes , 2008, SSDBM.
[15] Hongyan Liu,et al. C-Cubing: Efficient Computation of Closed Cubes by Aggregation-Based Checking , 2006, 22nd International Conference on Data Engineering (ICDE'06).
[16] Patrick Valduriez,et al. Join indices , 1987, TODS.