Dynamic View Selection for OLAP

  • Michael Lawrence
  • Andrew Rau-Chaplin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4081)


Due to the increasing size of data warehouses it is often infeasible to materialize all possible aggregate views for Online Analytical Processing. View selection, the task of selecting a subset of views to materialize based on knowledge of the incoming queries and updates, is an important and challenging problem. In this paper we explore Dynamic View Selection in which the distribution of queries changes over time, and a subset of a materialized view set is updated to better serve the incoming queries.


Simulated Annealing Data Warehouse Query Time Online Phase Aggregate Query 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Harinarayan, V., Rajaraman, A., Ullman, J.D.: Implementing data cubes efficiently. In: Proc. SIGMOD 1996, pp. 205–216. ACM Press, New York (1996)CrossRefGoogle Scholar
  2. 2.
    Shukla, A., Deshpande, P., Naughton, J.F.: Materialized view selection for multidimensional datasets. In: Proc. VLDB 1998, pp. 488–499. Morgan Kaufmann, San Francisco (1998)Google Scholar
  3. 3.
    Kalnis, P., Mamoulis, N., Papadias, D.: View selection using randomized search. Data Knowl. Eng. 42(1), 89–111 (2002)MATHCrossRefGoogle Scholar
  4. 4.
    Nadeau, T.P., Teorey, T.J.: Achieving scalability in OLAP materialized view selection. In: Proc. DOLAP 2002, pp. 28–34. ACM Press, New York (2002)CrossRefGoogle Scholar
  5. 5.
    Gupta, H., Mumick, I.S.: Selection of views to materialize in a data warehouse. Data Knowl. Eng. 17, 24–43 (2005)CrossRefGoogle Scholar
  6. 6.
    Uchiyama, H., Runapongsa, K., Teorey, T.J.: A progressive view materialization algorithm. In: Proc. DOLAP 1999, pp. 36–41. ACM Press, New York (1999)CrossRefGoogle Scholar
  7. 7.
    Baralis, E., Paraboschi, S., Teniente, E.: Materialized views selection in a multidimensional database. In: Proc. VLDB 1997, pp. 156–165. Morgan Kaufmann, San Francisco (1997)Google Scholar
  8. 8.
    Theodoratos, D., Dalamagas, T., Simitsis, A., Stavropoulos, M.: A Randomized Approach for the Incremental Design of an Evolving Data Warehouse. In: Kunii, H.S., Jajodia, S., Sølvberg, A. (eds.) ER 2001. LNCS, vol. 2224, pp. 325–338. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  9. 9.
    Theodoratos, D., Sellis, T.: Incremental design of a data warehouse. J. Intell. Inf. Syst. 15(1), 7–27 (2000)CrossRefGoogle Scholar
  10. 10.
    Liang, W., Wang, H., Orlowska, M.E.: Materialized view selection under the maintenance time constraint. Data Knowl. Eng. 37(2), 203–216 (2001)MATHCrossRefGoogle Scholar
  11. 11.
    Yu, J.X., Yao, X., Choi, C.-H., Gou, G.: Materialized view selection as constrained evolutionary optimization. In: IEEE Trans. on Syst., Man and Cybernetics, Part C, November 2003, vol. 33, pp. 458–467. IEEE, Los Alamitos (2003)Google Scholar
  12. 12.
    Lee, M., Hammer, J.: Speeding up materialized view selection in data warehouses using a randomized algorithm. J. Coop. Info. Syst. 10(3), 327–353 (2001)CrossRefGoogle Scholar
  13. 13.
    Gupta, H., Mumick, I.S.: Selection of views to materialize under a maintenance cost constraint. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 453–470. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  14. 14.
    Kotidis, Y., Roussopoulos, N.: A case for dynamic view management. J. Trans. Database Syst. 26(4), 388–423 (2001)MATHCrossRefGoogle Scholar
  15. 15.
    Agrawal, S., Chaudhuri, S., Narasayya, V.R.: Automated selection of materialized views and indexes in sql databases. In: Proc. VLDB 2000, pp. 496–505. Morgan Kaufmann, San Francisco (2000)Google Scholar
  16. 16.
    Loukopoulos, T., Kalnis, P., Ahmad, I., Papadias, D.: Active caching of on-line-analytical-processing queries in www proxies. In: Proc. ICPP 2001, pp. 419–426. IEEE, Los Alamitos (2001)Google Scholar
  17. 17.
    Kalnis, P., Ng, W.S., Ooi, B.C., Papadias, D., Tan, K.-L.: An adaptive peer-to-peer network for distributed caching of olap results. In: Proc. SIGMOD 2002, pp. 25–36. ACM Press, New York (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Michael Lawrence
    • 1
  • Andrew Rau-Chaplin
    • 1
  1. 1.Faculty of Computer ScienceDalhousie UniversityHalifaxCanada

Personalised recommendations