Design and implementation of materialized cubes genetic algorithm

[1] Han Jiawei, Kamber M. Data mining[M]. Beijing:Higher Education Press, 2001 [2]Harinarayan V, Rajaraman A. Implementing data cubes efficiently . In:Jagadish H V, Mumick I S. Proceedings of ACM SIGMOD International Conference on Management of Data . New York:ACM Press,1996.205~216 [3]Gray J, Bosworth A, Layman A, et al. Data cube:a relational aggregation operator generalizing group-by, cross-tab, and sub-totals[J]. Data Mining and Knowledge Discovery, 1997, 1(1):29~53 [4]Neill F O, Graefe G . Multi-table joins through bitmapped join indices . ACM SIGMOD Record . 1995. 24(3):8~11 [5]Gjyssens M, Lakshmanan L V S. A foundation for multi-dimensional databases . Proceedings of the Twentythird International Conference on Very Large Databases . Athens, 1997.106~115 [6]Guting R H. An introduction to spatial database systems[J].VLDB Journal, 1994,3(4):357~399 [7]Agrawal R, Gupta A, Sarawagi S. Modeling multidimensional databases . In:Gray A, Larson P. Proceedings of the 13th International Conference and Data Engineering . Birmingham:IEEE Computer Society Press, 1997.232~243 [8]Lee M, Hammer J. Speeding up warehouse physical design using a randomized algorithm . Proceedings of the International Workshop on Design and Management of Data Warehouses . Heidelberg, Germany, 1999 [9]Zhang Chuan, Yao Xin, Yang Jian. An evolutionary approach to materialized views selection in a data warehouse environment[J].IEEE Transactions on Systems, Man and Cybernetics, 2001,31(3):282~294