Simultaneous determination of view selection and update policy with stochastic query and response time constraints

  • Authors:
  • Yu-Chin Liu;Ping-Yu Hsu;Gwo-Ji Sheen;Steve Ku;Kai-Wen Chang

  • Affiliations:
  • Department of Information Management, Shih Hsin University, Taipei 116, Taiwan, ROC;Department of Business Administration, National Central University, Jhongli 320, Taiwan, ROC;Institute of Industrial Management, National Central University, Jhongli 320, Taiwan, ROC;Institute of Industrial Management, National Central University, Jhongli 320, Taiwan, ROC;Institute of Industrial Management, National Central University, Jhongli 320, Taiwan, ROC

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2008

Quantified Score

Hi-index 0.07

Visualization

Abstract

Data warehouses are built to reply query searches efficiently from integrated data of various systems. To improve the performance of the system, the issue of materializing views within data warehouses must be explored. This involves to pre-compute a set of selected views which are fact and dimension tables, under given resource and quality constraints. The quality constraints include query processing time, data maintenance time and the freshness of data when queries are placed. Then there is the policy of updating, which treats the time issue of data reloading in data warehouses. A model is proposed to determine the view selection and update policy when the arrival of queries follows Poisson processes with the constraints of system response time, storage space and query dependent currency of data (on systems capable of periodic and query-triggered updates). To the best of the researchers' knowledge, no other research has considered all these factors in their models. A two-phase greedy algorithm was developed to determine the optimal update policy for the view selection problem. Numerous experiments were performed to explore the sensitivity of the proposed model under various constraints and system parameter settings. The results show that the model has reasonable responses to the tunings and that the proposed algorithm can rapidly find acceptable solutions.