A view selection algorithm with performance guarantee

A view selection algorithm takes as input a fact table and computes a set of views to store in order to speed up queries. The performance of view selection algorithm is usually measured by three criteria: (1) the amount of memory to store the selected views, (2) the query response time and (3) the time complexity of this algorithm. The two first measurements deal with the output of the algorithm. No existing solutions give good trade-off between amount of memory and queries cost with a small time complexity. We propose in this paper an algorithm guaranteeing a constant approximation factor of queries response time with respect to the optimal solution. Moreover, the time complexity for a Ddimensional fact table is O(D ∗ 2D ) corresponding to the fastest known algorithm. We provide an experimental comparison with two other well known algorithms showing that our approach also gives good performance in terms of memory.

• Type: Conference
• Year: 2009
• Where: EDBT
• Authors: Nicolas Hanusse, Sofian Maabout, Radu Tofan
• Keywords: EDBT 2009, Response Time, Time Complexity, View Selection Algorithm