Deterministic View Selection for Data-Analysis Queries: Properties and Algorithms

Abstract

The view-selection problem is a combinatorial optimization problem that arises in the context of on-line analytical processing (OLAP) in database management systems. We pose the problem as an integer programming (IP) model, study its structural properties, and propose effective techniques for reducing the search space of views and thus the size of the corresponding IP model. We then use these results to design both exact methods and heuristic algorithms that are effective for solving relatively large realistic-size instances of the problem.