Achieving scalability in OLAP materialized view selection

@inproceedings{Nadeau2002AchievingSI,
  title={Achieving scalability in OLAP materialized view selection},
  author={Thomas P. Nadeau and Toby J. Teorey},
  booktitle={DOLAP},
  year={2002}
}
The goal of on-line analytical processing (OLAP) is to quickly answer queries from large amounts of data residing in a data warehouse. Materialized view selection is an optimization problem encountered in OLAP systems. Published work on the problem of materialized view selection presents solutions scalable in the number of possible views. However, the number of possible views is exponential relative to the number of database dimensions. A truly scalable solution must be polynomial time relative… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 26 CITATIONS

ROLAP implementations of the data cube

VIEW 14 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Greedy Selection of Materialized Views

VIEW 9 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Materialised view selection using BCO

VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A Reduced Lattice Greedy Algorithm for Selecting Materialized Views

VIEW 7 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Solving View Selection Problem to Query Plan Using Meta Heuristic Methods

  • 2018 1st Annual International Conference on Information and Sciences (AiCIS)
  • 2018

An Improved Algorithm of Materialized View Selection within the Confinement of Space

  • 2015 IEEE Fifth International Conference on Big Data and Cloud Computing
  • 2015
VIEW 2 EXCERPTS
CITES METHODS & BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-2 OF 2 REFERENCES