Abstract
View materialization is a commonly used technique in many data-intensive systems to improve the query performance. Increasing need for large-scale data processing has led to investigating the view selection problem in distributed complex scenarios where a set of cooperating computer nodes may share data and issue numerous queries. In our work, the view selection and data placement problem is studied given a limited amount of resources e.g. storage space capacity per computer node and maximum view maintenance cost. We also consider the IO and CPU costs for each computer node as well as the network bandwidth. To address this problem, we have proposed a constraint programming approach which is based on constraint reasoning to tackle problems that aim to satisfy a set of constraints. Then, we have designed a set of efficient heuristics that result in a drastic reduction in the solution space so that the problem becomes solvable for complex scenarios consisting of realistically large numbers of sites, queries and views. Our experimental study shows that our approach performs consistently better compared to a practical approach designed for large-scale distributed environments which uses a genetic algorithm to compute which view has to be materialized at what computer node.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Choco, open-source software for constraint satisfaction problems. http://www.emn.fr/z-info/choco-solver
The TPC benchmark H (TPC-H). http://www.tpc.org/tpch/spec/tpch2.14.3.pdf
Bauer, A., Lehner, W.: On solving the view selection problem in distributed data warehouse architectures. In: SSDBM, pp. 43-51, Cambridge (2003)
Apt, K.: Principles of Constraint Programming. Cambridge University Press, New York (2003)
Baril, X., Bellahsene, Z.: Selection of materialized views: a cost-based approach. In: CAiSE, pp. 665–680, Klagenfurt (2003)
Bellahsene, Z., Cart, M., Kadi, N.: A cooperative approach to view selection and placement in P2P systems. In: Meersman, R., Dillon, T.S., Herrero, P. (eds.) OTM 2010. LNCS, vol. 6426, pp. 515–522. Springer, Heidelberg (2010)
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)
Derakhshan, R., Dehne, F.K., Korn, O., Stantic, B.: Simulated annealing for materialized view selection in data warehousing environment. In: Databases and Applications, pp. 89–94, (2006)
Derakhshan, R., Stantic, B., Korn, O., Dehne, F.K.H.A.: Parallel simulated annealing for materialized view selection in datawarehousing environments. In: ICA3PP, pp. 121–132, island of Cyprus (2008)
Deshpande, P.M., Ramasamy, K., Shukla, A., Naughton, J.F.: Caching multidimensional queries using chunks. In: SIGMOD Conference, pp. 259–270, Seattle (1998)
Du, W., Krishnamurthy, R., Shan, M.C.: Query optimization in heterogeneous dbms. In: Proceeding of VLDB, pp. 277–91, Vancouver (1992)
Gribble, S.D., Halevy, A.Y., Ives, Z.G., Rodrig, M., Suciu, D.: What can database do for peer-to-peer? In: WebDB, pp. 31–36, Santa Barbara (2001)
Gupta, H.: Selection of views to materialize in a data warehouse. In: ICDT, pp. 98–112, Delphi (1997)
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)
Gupta, H., Mumick, I.S.: Selection of views to materialize in a data warehouse. IEEE Trans. Knowl. Data Eng. 17(1), 24–43 (2005)
Harinarayan, V., Rajaraman, A., Ullman, J.D.: Implementing data cubes efficiently. In: SIGMOD Conference, pp. 205–216, Montreal (1996)
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)
Kalnis, P., Mamoulis, N., Papadias, D.: View selection using randomized search. Data Knowl. Eng. 42(1), 89–111 (2002)
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: SIGMOD Conference, pp. 25–36, Madison (2002)
Kossmann, D.: The state of the art in distributed query processing. ACM Comput. Surv. 32(4), 422–469 (2000)
Kossmann, D., Franklin, M.J., Drasch, G.: Cache investment: integrating query optimization and distributed data placement. ACM TODS 252000 (2000)
Kotidis, Y., Roussopoulos, N.: Dynamat: a dynamic view management system for data warehouses. In: SIGMOD Conference, pp. 371–382, Philadephia (1999)
Kumar, T.V., Kumar, S.: Materialized view selection using genetic algorithm. In: IC3, pp. 225–237 (2012)
Labio, W.J., 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, Washington, DC (1997)
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)
Ligoudistianos, S., Theodoratos, D., Sellis, T.: Experimental evaluation of data warehouse configuration algorithms. In: DEXA Workshop, pp. 218–223, Vienna (1998)
Mackert, L.F., Lohman, G.M.: R* optimizer validation and performance evaluation for local queries. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 1986, pp. 84–95. ACM, New York (1986)
Mami, I., Bellahsene, Z.: A survey of view selection methods. SIGMOD Record 41(1), 20–29 (2012)
Mami, I., Bellahsene, Z., Coletta, R.: View selection under multiple resource constraints in a distributed context. In: Liddle, S.W., Schewe, K.-D., Tjoa, A.M., Zhou, X. (eds.) DEXA 2012, Part II. LNCS, vol. 7447, pp. 281–296. Springer, Heidelberg (2012)
Mami, I., Bellahsene, Z., Coletta, R.: A declarative approach to view selection modeling. Trans. Large-Scale Data Knowl. Centered Syst. 10, 115–145 (2013)
Mami, I., Coletta, R., Bellahsene, Z.: Modeling view selection as a constraint satisfaction problem. In: Hameurlain, A., Liddle, S.W., Schewe, K.-D., Zhou, X. (eds.) DEXA 2011, Part II. LNCS, vol. 6861, pp. 396–410. Springer, Heidelberg (2011)
Mistry, H., Roy, P., Sudarshan, S., Ramamritham, K.: Materialized view selection and maintenance using multi-query optimization. In: SIGMOD Conference, pp. 307–318, Santa Barbara (2001)
Nguyen, T.V.A., Bimonte, S., d’Orazio, L., Darmont, J.: Cost models for view materialization in the cloud. In: EDBT/ICDT Workshops, pp. 47–54, Berlin (2012)
Özsu, M.T., Valduriez, P.: Principles of Distributed Database Systems, 3rd edn. Springer, New York (2011)
De Raedt, L., Guns, T., Nijssen, S.: Constraint programming for itemset mining. In: KDD, pp. 204–212, Las Vegas (2008)
Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming (Foundations of Artificial Intelligence). Elsevier Science Inc., New York (2006)
Roy, P., Seshadri, S., Sudarshan, S., Bhobe, S.: Efficient and extensible algorithms for multi query optimization. In: SIGMOD Conference, pp. 249–260, Dallas (2000)
Scheuermann, P., Shim, J., Vingralek, R.: A data warehouse intelligent cache manager. In: VLDB, pp. 51–62, Bombay (1996)
Selinger, P.G., Astrahan, M.M., Chamberlin, D.D., Lorie, R.A., Price, T.G.: Access path selection in a relational database management system, pp. 23–34 (1979)
Steinbrunn, M., Moerkotte, G., Kemper, A.: Heuristic and randomized optimization for the join ordering problem. VLDB J. 6(3), 191–208 (1997)
Theodoratos, D., Ligoudistianos, S., Sellis, T.K.: View selection for designing the global data warehouse. Data Knowl. Eng. 39(3), 219–240 (2001)
Theodoratos, D., Sellis, T.K.: Data warehouse configuration. In: VLDB, pp. 126–135, Athens (1997)
Ye, W., Gu, N., Yang, G., Liu, Z.: Extended derivation cube based view materialization selection in distributed data warehouse. In: Fan, W., Wu, Z., Yang, J. (eds.) WAIM 2005. LNCS, vol. 3739, pp. 245–256. Springer, Heidelberg (2005)
Yu, J.X., Yao, X., Choi, C.H., Gou, G.: Materialized view selection as constrained evolutionary optimization. IEEE Trans. Syst. Man Cybern. Part C 33(4), 458–467 (2003)
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)
Zhang, C., Yao, X., Yang, J.: An evolutionary approach to materialized views selection in a data warehouse environment. IEEE Trans. Syst. Man Cybern. Part C 31(3), 282–294 (2001)
Zhou, J., Larson, P-Å, Goldstein, J., Ding, L.: Dynamic materialized views. In: ICDE, pp. 526–535, Istanbul (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Mami, I., Bellahsene, Z., Coletta, R. (2016). A Constraint Optimization Method for Large-Scale Distributed View Selection. In: Hameurlain, A., Küng, J., Wagner, R. (eds) Transactions on Large-Scale Data- and Knowledge-Centered Systems XXV. Lecture Notes in Computer Science(), vol 9620. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49534-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-49534-6_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-49533-9
Online ISBN: 978-3-662-49534-6
eBook Packages: Computer ScienceComputer Science (R0)