MVPP-Based Materialized View Selection in Data Warehouses Using Simulated Annealing

被引:6
作者
Mohseni, Mohsen [1 ]
Sohrabi, Mohammad Karim [1 ]
机构
[1] Islamic Azad Univ, Semnan Branch, Dept Comp Engn, Semnan, Iran
关键词
Data warehouse; materialized view selection; simulated annealing; MVPP; optimization; OPTIMIZATION ALGORITHM; EFFICIENT; SEARCH;
D O I
10.1142/S021884302050001X
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The process of extracting data from different heterogeneous data sources, transforming them into an integrated, unified and cleaned repository, and storing the result as a single entity leads to the construction of a data warehouse (DW), which facilitates access to data for the users of information systems and decision support systems. Due to their enormous volumes of data, processing of analytical queries of decision support systems need to scan very large amounts of data, which has a negative effect on the systems' response time. Because of the special importance of online analytical processing (OLAP) in these systems, to enhance the performance and improve the query response time of the system, an appropriate number of views of the DW are selected for materialization and will be utilized for responding to the analytical queries, instead of direct access to the base relations. Memory constraint and views maintenance overhead are two main limitations that make it impossible, in most cases, to materialize all views of the DW. Selecting a proper set of views of DW for materialization, called materialized view selection (MVS) problem, is an important research issue that has been focused in various papers. In this paper, we have proposed a method, called P-SA, to select an appropriate set of views using an improved version of simulated annealing (SA) algorithm that utilizes a proper neighborhood selection strategy. P-SA uses the multiple view processing plan (MVPP) structure for selecting the views. Data and queries of a benchmark DW have been used in experimental results for evaluating the introduced method. The experimental results show better performance of the P-SA compared to other SA-based MVS methods for increasing the number of queries, in terms of the total cost of view maintenance and query processing. Moreover, the total cost of queries in the P-SA is also better than the other important SA-based MVS methods of the literature when the size of the DW is increased.
引用
收藏
页数:19
相关论文
共 48 条
  • [1] Al Saedi A. K. Z., 2018, P 1 ANN INT C INF SC
  • [2] [Anonymous], 2010, SCI TECHNOLOGY IND
  • [3] Data mining-based materialized view and index selection in data warehouses
    Aouiche, Kamel
    Darmont, Jerome
    [J]. JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2009, 33 (01) : 65 - 93
  • [4] Arun Biri, 2015, International Journal of Software Science and Computational Intelligence, V7, P35, DOI 10.4018/IJSSCI.2015100103
  • [5] Materialized view selection using artificial bee colony optimization
    Arun B.
    Vijay Kumar T.V.
    [J]. 2017, IGI Global (13) : 26 - 49
  • [6] A novel coral reefs optimization algorithm for materialized view selection in data warehouse environments
    Azgomi, Hossein
    Sohrabi, Mohammad Karim
    [J]. APPLIED INTELLIGENCE, 2019, 49 (11) : 3965 - 3989
  • [7] A game theory based framework for materialized view selection in data warehouses
    Azgomi, Hossein
    Sohrabi, Mohammad Karim
    [J]. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2018, 71 : 125 - 137
  • [8] Chaves LeonardoWeiss F., 2009, Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, EDBT 09, P1088
  • [9] Chuan Zhang, 1999, Data Warehousing and Knowledge Discovery. First International Conference, DaWaK'99. Proceedings (Lecture Notes in Computer Science Vol.1676), P116
  • [10] Derakhshan R, 2008, LECT NOTES COMPUT SC, V5022, P121, DOI 10.1007/978-3-540-69501-1_14