Skip to main content
SpringerLink
Log in
Book cover

International Conference on Database and Expert Systems Applications

DEXA 2011: Database and Expert Systems Applications pp 396–410Cite as

Modeling View Selection as a Constraint Satisfaction Problem

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6861))

Abstract

Using materialized views can highly speed up the query processing time. 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. However, the solution space is huge since it entails a large number of possible combinations of views. For this matter, we have designed a solution involving constraint programming, which has proven to be a powerful approach for modeling and solving combinatorial problems. The efficiency of our method is evaluated using workloads consisting of queries over the schema of the TPC-H benchmark. We show experimentally that our approach provides an improvement in the solution quality (i.e., the quality of the obtained set of materialized views) in term of cost saving compared to genetic algorithm in limited time. Furthermore, our approach scales well with the query workload size.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. TPC-R Benchmark Standard Specication 2.01 (January 1999), http://www.tpc.org

  2. Baril, X., Bellahsene, Z.: Selection of materialized views: A cost-based approach. In: CAiSE, pp. 665–680 (2003)

    Google Scholar 

  3. Bello, R.G., Dias, K., Downing, A., Feenan Jr., J.J., Finnerty, J.L., Norcott, W.D., Sun, H., Witkowski, A., Ziauddin, M.: Materialized views in oracle. In: VLDB, pp. 659–664 (1998)

    Google Scholar 

  4. Caseau, Y., Laburthe, F.: Improved clp scheduling with task intervals. In: ICLP, pp. 369–383 (1994)

    Google Scholar 

  5. Chaves, L.W.F., Buchmann, E., Hueske, F., Böhm, K.: Towards materialized view selection for distributed databases. In: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology EDBT 2009, pp. 1088–1099. ACM, New York (2009)

    Chapter  Google Scholar 

  6. Chirkova, R., Halevy, A.Y., Suciu, D.: A formal perspective on the view selection problem. VLDB J. 11(3), 216–237 (2002)

    Article  MATH  Google Scholar 

  7. Derakhshan, R., Dehne, F.K.H.A., Korn, O., Stantic, B.: Simulated annealing for materialized view selection in data warehousing environment. In: Databases and Applications, pp. 89–94 (2006)

    Google Scholar 

  8. Derakhshan, R., Stantic, B., Korn, O., Dehne, F.: Parallel simulated annealing for materialized view selection in data warehousing environments. In: Bourgeois, A.G., Zheng, S.Q. (eds.) ICA3PP 2008. LNCS, vol. 5022, pp. 121–132. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Dincbas, M., Simonis, H., Van Hentenryck, P.: Solving large combinatorial problems in logic programming. The Journal of Logic Programming 8(1-2), 75–93 (1990)

    Article  MATH  Google Scholar 

  10. Goldberg, D.E.: Genetic Algorithms in Search Optimization and Machine Learning. Addison-Wesley, Reading (1989)

    MATH  Google Scholar 

  11. Gupta, H.: Selection of views to materialize in a data warehouse. In: ICDT, pp. 98–112 (1997)

    Google Scholar 

  12. 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)

    Chapter  Google Scholar 

  13. Horng, J.-T., Chang, Y.-J., Liu, B.-J.: Applying evolutionary algorithms to materialized view selection in a data warehouse. Soft Comput. 7(8), 574–581 (2003)

    Article  Google Scholar 

  14. Kalnis, P., Mamoulis, N., Papadias, D.: View selection using randomized search. Data Knowl. Eng. 42(1), 89–111 (2002)

    Article  MATH  Google Scholar 

  15. Labio, W., Quass, D., Adelberg, B.: Physical database design for data warehouses. In: Proceedings of the Thirteenth International Conference on Data Engineering ICDE 1997, pp. 277–288. IEEE Computer Society, USA (1997)

    Google Scholar 

  16. Lawrence, M.: Multiobjective genetic algorithms for materialized view selection in olap data warehouses. In: GECCO, pp. 699–706 (2006)

    Google Scholar 

  17. Lecoutre, C., Roussel, O., van Dongen, M.R.C.: Promoting robust black-box solvers through competitions. Constraints 15(3), 317–326 (2010)

    Article  MATH  Google Scholar 

  18. Lee, M., Hammer, J.: Speeding up materialized view selection in data warehouses using a randomized algorithm. Int. J. Cooperative Inf. Syst. 10(3), 327–353 (2001)

    Article  Google Scholar 

  19. Michalewicz, Z.: Genetic algorithms + data structures = evolution programs, 3rd edn. Springer, London (1996)

    MATH  Google Scholar 

  20. Mistry, H., Roy, P., Ramamritham, K., Sudarshan, S.: Materialized view selection and maintenance using multi-query optimization. CoRR, cs.DB/0003006 (2000)

    Google Scholar 

  21. Mistry, H., Roy, P., Sudarshan, S., Ramamritham, K.: Materialized view selection and maintenance using multi-query optimization. In: SIGMOD Conference, pp. 307–318 (2001)

    Google Scholar 

  22. Nilsson, N.J.: Problem-Solving Methods in Artificial Intelligence. McGraw-Hill Pub. Co., New York (1971)

    Google Scholar 

  23. Ross, K.A., Srivastava, D., Sudarshan, S.: Materialized view maintenance and integrity constraint checking: Trading space for time. In: SIGMOD Conference, pp. 447–458 (1996)

    Google Scholar 

  24. Roy, P., Seshadri, S., Sudarshan, S., Bhobe, S.: Efficient and extensible algorithms for multi query optimization. CoRR, cs.DB/9910021 (1999)

    Google Scholar 

  25. Roy, P., Seshadri, S., Sudarshan, S., Bhobe, S.: Efficient and extensible algorithms for multi query optimization. In: SIGMOD Conference, pp. 249–260 (2000)

    Google Scholar 

  26. Valluri, S.R., Vadapalli, S., Karlapalem, K.: View relevance driven materialized view selection in data warehousing environment. In: Australasian Database Conference (2002)

    Google Scholar 

  27. Wallace, M.: Practical applications of constraint programming. Constraints 1, 139–168 (1996); 10.1007/BF00143881

    Article  MathSciNet  Google Scholar 

  28. Widom, J.: Research problems in data warehousing. In: CIKM, pp. 25–30 (1995)

    Google Scholar 

  29. Yang, J., Karlapalem, K., Li, Q.: Algorithms for materialized view design in data warehousing environment. In: VLDB, pp. 136–145 (1997)

    Google Scholar 

  30. Yu, J.X., Yao, X., Choi, C.-H., Gou, G.: Materialized view selection as constrained evolutionary optimization. IEEE Transactions on Systems, Man, and Cybernetics, Part C 33(4), 458–467 (2003)

    Article  Google Scholar 

  31. Zhang, C., Yang, J.: Genetic algorithm for materialized view selection in data warehouse environments. In: Mohania, M., Tjoa, A.M. (eds.) DaWaK 1999. LNCS, vol. 1676, pp. 116–125. Springer, Heidelberg (1999)

    Google Scholar 

  32. Zhang, C., Yao, X., Yang, J.: An evolutionary approach to materialized views selection in a data warehouse environment. IEEE Transactions on Systems, Man, and Cybernetics, Part C 31(3), 282–294 (2001)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIRMM, University Montpellier 2, 161 Rue Ada, F-34095, Montpellier, France

    Imene Mami, Remi Coletta & Zohra Bellahsene

Authors
  1. Imene Mami
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Remi Coletta
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zohra Bellahsene
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IRIT Institut de Recherche en Informatique de Toulouse, Paul Sabatier University, 118, route de Narbonne, 31062, Toulouse Cedex, France

    Abdelkader Hameurlain

  2. Brigham Young University, 784 TNRB, 84602, Provo, UT, USA

    Stephen W. Liddle

  3. Software Competence Center Hagenberg and Johannes-Keppler-University Linz, Softwarepark 21, 4232, Hagenberg, Austria

    Klaus-Dieter Schewe

  4. School of Information Technology and Electrical Engineering, University of Queensland, QLD 4072, Brisbane, Australia

    Xiaofang Zhou

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mami, I., Coletta, R., Bellahsene, Z. (2011). Modeling View Selection as a Constraint Satisfaction Problem. In: Hameurlain, A., Liddle, S.W., Schewe, KD., Zhou, X. (eds) Database and Expert Systems Applications. DEXA 2011. Lecture Notes in Computer Science, vol 6861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23091-2_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23091-2_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23090-5

  • Online ISBN: 978-3-642-23091-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation