首页    期刊浏览 2024年09月22日 星期日
登录注册

文章基本信息

  • 标题:Weighted Constraint Satisfaction and Genetic Algorithm to Solve the View Selection Problem
  • 本地全文:下载
  • 作者:Mohammed El Alaoui ; Karim El moutaouakil ; Mohamed Ettaouil
  • 期刊名称:International Journal of Database Management Systems
  • 印刷版ISSN:0975-5985
  • 电子版ISSN:0975-5705
  • 出版年度:2017
  • 卷号:9
  • 期号:4
  • 页码:11
  • DOI:10.5121/ijdms.2017.9402
  • 出版社:Academy & Industry Research Collaboration Center (AIRCC)
  • 摘要:A Data warehouse is a tool that is used by big companies, and it gathers data coming from differentsources. The main goal of a data warehouse is not only to store data, but also to help companies to makedecisions. The huge volume of data makes processing queries complex and time-consuming. In order tosolve this problem, the materialization of views is suggested as a solution to improve the processing of thequeries. The materialization of views aims to optimize an objective function which is a compromise betweenthe cost of processing queries and the cost of maintenance under a storage space constraint. In this work,we modelled the view selection problem as a weight constraint satisfaction problem. In addition, we use theused the multiple view processing plans (MVPP) Framework as a search space, and we call geneticalgorithm to select views to be materialized. According to experimental result, the proposed algorithm hasbeen used to show the quality of the appropriate materialized views selection.
  • 关键词:Data warehouse; multiple view processing plans; genetic algorithm; weighted constraint satisfaction;problem; storage space constraint.
国家哲学社会科学文献中心版权所有