A formal perspective on the view selection problem

@article{Chirkova2002AFP,
  title={A formal perspective on the view selection problem},
  author={Rada Y. Chirkova and Alon Y. Halevy and Dan Suciu},
  journal={The VLDB Journal},
  year={2002},
  volume={11},
  pages={216-237}
}
Abstract. The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that the views fit into a prespecified storage constraint. The two main applications of the view selection problem are materializing views in a database to speed up query processing, and selecting views to materialize in a data warehouse to answer decision support queries. In addition, view selection is a core… 
View on Springer
www4.ncsu.edu
183 Citations
Highly Influential Citations
6
Background Citations
93
Methods Citations
21
Results Citations
5

183 Citations

The view-selection problem has an exponential-time lower bound for conjunctive queries and views

It is proved that under the more practical sum-cost model, the view-selection problem has an exponential time lower bound, which means it is impossible to come up with a view- selection algorithm that outputs a polynomial number of views for all query workloads and databases, yet produces optimal selections of views.

Modeling View Selection as a Constraint Satisfaction Problem

This paper deals with the view selection issue, which consists in finding a set of views to materialize that minimizes the expected cost of evaluating the query workload, given a limited amount of resource such as total view maintenance cost and/or storage space.

A Formal Model for the Problem of View Selection for Aggregate Queries

This paper uses an integer-programming model to obtain optimal solutions to the problem of view selection for aggregate queries on data warehouses and reports the results of the post-optimality analysis that was performed to determine the impact of changing certain input characteristics on the optimal solution.

Selection of views to materialize in a data warehouse

This work presents polynomial-time heuristics for a selection of views to optimize total query response time under a disk-space constraint, for some important special cases of the general data warehouse scenario, viz. an AND view graph, where each query/view has a unique evaluation, and extends this heuristic to the general AND-OR view graphs.

View selection for real conjunctive queries

This paper studies the complexity of the view-selection problem for conjunctive queries and views under set semantics, and shows that bag semantics is the “easiest to handle”, whereas under set and bag-set semantics the authors assume further restrictions on the query workload to achieve the same complexity.

Materialized View Selection : A Survey

This section mainly categorize and review the existing approaches to materialized view selection and starts by introducing a model treating the view selection problem as an optimization problem.

Answering queries using views: A survey

  • A. Halevy
  • Computer Science
    The VLDB Journal
  • 2001
The state of the art on the problem of answering queries using views is surveyed, the algorithms proposed to solve it are described, and the disparate works into a coherent framework are synthesized.

The View Selection Problem for Regular Path Queries

This paper presents an algorithm that for a given finite set of workload queries, i.e. for a set of regular languages, computes aSet of views that can answer every query in the workload and has minimal possible cardinality.

A Declarative Approach to Modeling and Solving the View Selection Problem. (Une approche déclarative pour la modélisation et la résolution du problème de la sélection de vues à matérialiser)

A solution using constraint programming which is known to be efficient for the resolution of NP-complete problems and a powerful method for modeling and solving combinatorial optimization problems is designed for the view selection problem in a centralized context and in a distributed setting.

Using Relational Database Constraints to Design Materialized Views in Data Warehouses

This paper develops a solution for identifying the candidate view space of materialization and presents algorithms for generating a union-view and a partial-view, both of which are good candidates for materialization.
...

References

SHOWING 1-10 OF 22 REFERENCES

The view-selection problem has an exponential-time lower bound for conjunctive queries and views

It is proved that under the more practical sum-cost model, the view-selection problem has an exponential time lower bound, which means it is impossible to come up with a view- selection algorithm that outputs a polynomial number of views for all query workloads and databases, yet produces optimal selections of views.

Selection of Views to Materialize Under a Maintenance Cost Constraint

This article develops algorithms to select a set of views to materialize in a data warehouse in order to minimize the total query response time under the constraint of a given total view maintenance time and designs an A* heuristic, that delivers an optimal solution.

Answering queries using views: A survey

  • A. Halevy
  • Computer Science
    The VLDB Journal
  • 2001
The state of the art on the problem of answering queries using views is surveyed, the algorithms proposed to solve it are described, and the disparate works into a coherent framework are synthesized.

Speeding up Warehouse Physical Design Using a Randomized Algorithm

This paper focuses on an efficient solution to the maintenance-cost view selection problem using a genetic algorithm for computing a near-optimal set of views in the context of OR view graphs and shows that it represents a dramatic improvement in time complexity over existing search-based approaches using heuristics.

On the complexity of the view-selection problem

The results prove (if P#NP) that the viewselection problem is essentially inapproximable for general partial orders, and studies of the Harinarayan, Rajaraman and Ullman framework and its generalizations should focus on special cases of practical significance, such as hypercubes, and on experimental comparison of heuristics.

Answering queries using views (extended abstract)

It is shown that all the possible rewritings can be obtained by considering cent ainment mappings from the views to the query, and that the problems considered are NP-complete when both the query and the views are conjunctive and don’t involve builtin comparison predicates.

Data Warehouse Configuration

In the data warehousing approach to the integration of data from multiple information sources, selected information is extracted in advance and stored in a repository. A data warehouse (DW) can…

Implementing data cubes efficiently

This paper investigates the issue of which cells (views) to materialize when it is too expensive to materialized all views, and presents greedy algorithms that work off this lattice and determine a good set of views to materializing.

Optimizing queries using materialized views: a practical, scalable solution

A fast and scalable algorithm for determining whether part or all of a query can be computed from materialized views and how it can be incorporated in transformation-based optimizers is presented.

Materialized view maintenance and integrity constraint checking: trading space for time

It is shown that it is possible to reduce the total time cost of view maintenance by materializing (and maintaining) additional views, and it is demonstrated that global optimization cannot, in general, be achieved by locally optimizing each materialized subview.