基于遗传算法的数据方体系统设计  

Data cube system design with genetic algorithms

作　　者：梁夷龙[1] 夏绍玮[1] 

机构地区：[1]清华大学自动化系,北京100084

出　　处：《清华大学学报（自然科学版）》2004年第1期110-113,共4页Journal of Tsinghua University(Science and Technology)

基　　金：国家自然科学基金资助项目(69775001)

摘　　要：决策支持系统实际应用的需求是用户提出的一组频繁查询。为了在系统资源有限的情况下快速有效的回答这些查询,该文提出了基于查询的数据方体系统设计问题。并使用结合了启发式算法的混合遗传算法来优化数据方体系统。在通用数据库上对各种算法进行了实验比较。实验结果表明了该文提出的混合遗传算法在多数情况下可以取得最优解。在不同的系统维护成本的限制下,混合遗传算法都比Harinarayan贪婪算法有效。维护成本越低,效果越明显。Decision support systems need to respond to frequently asked queries given by users. A data cube system design based on queries was developed to quickly and effectively answer these queries within the system resource limitations. A hybrid genetic algorithm using heuristic information was developed to optimize the data cube system. Tests on a common database showed that the hybrid genetic algorithm quickly reached the optimal solution in most situations. The algorithm is more effective than the greedy algorithm with different system maintenance cost limitations. Since the lower maintenance cost is, the more useful effect is.

关 键 词：遗传算法 数据方体 系统设计 联机分析处理 决策支持系统 数据库 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]