Abstract
In this paper, we investigate the problem of view selection for workloads of conjunctive queries under bag semantics. In particular we aim to limit the search space of candidate viewsets. In that respect we start delineating the boundary between query workloads for which certain restricted search spaces suffice. They suffice in the sense that they do not compromise optimality in that they contain at least one of the optimal solutions. We start with the general case, where we give a tight condition that candidate views can satisfy and still the search space (thus limited) does contain at least one optimal solution. Preliminary experiments show that this reduces the size of the search space significantly. Then we study special cases. We show that for chain query workloads, taking only chain views may miss all optimum solutions, whereas, if we further limit the queries to be path queries (i.e., chain queries over a single binary relation), then path views suffice. This last result shows that in the case of path queries, taking query subexpressions suffice.
This paper is part of the 03EΔ176 research project, implemented within the framework of the “Reinforcement Programme of Human Research Manpower” (PENED) and co-financed by National and Community Funds (25% from the Greek Ministry of Development-General Secretariat of Research and Technology and 75% from E.U.-European Social Fund).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)
Afrati, F., Chirkova, R., Gergatsoulis, M., Pavlaki, V.: View selection for real conjunctive queries. Acta Inf. 44(5), 289–321 (2007)
Afrati, F.N., Chirkova, R.: Selecting and using views to compute aggregate queries (extended abstract). In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol. 3363, pp. 383–397. Springer, Heidelberg (2004)
Afrati, F.N., Li, C., Ullman, J.D.: Generating efficient plans for queries using views. In: SIGMOD Conference 2001, pp. 319–330 (2001)
Andrews, G.E., Eriksson, K.: Integer Partitions. Cambridge University Press, Cambridge (2004)
Baralis, E., Paraboschi, S., Teniente, E.: Materialized views selection in a multidimensional database. In: VLDB 1997, pp. 156–165 (1997)
Chirkova, R., Genesereth, M.R.: Linearly bounded reformulations of conjunctive databases. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS, vol. 1861, pp. 987–1001. Springer, Heidelberg (2000)
Chirkova, R., Halevy, A.Y., Suciu, D.: A formal perspective on the view selection problem. The VLDB Journal 11(3), 216–237 (2002)
Chirkova, R., Li, C.: Materializing views with minimal size to answer queries. In: PODS, pp. 38–48 (2003)
Florescu, D., Levy, A.Y., Suciu, D., Yagoub, K.: Optimization of run-time management of data intensive web-sites. In: VLDB 1999, pp. 627–638 (1999)
Gupta, H., Harinarayan, V., Rajaraman, A., Ullman, J.D.: Index selection for OLAP. In: ICDE 1997, pp. 208–219 (1997)
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. SIGMOD Rec. 25(2), 205–216 (1996)
Karloff, H., Mihail, M.: On the complexity of the view-selection problem. In: PODS 1999, pp. 167–173 (1999)
Lloyd, J.W.: Foundations of logic programming. Springer, Heidelberg (1984)
Plotkin, G.: A note on inductive generalization. Machine Intelligence 5, 153–163 (1970)
Pottinger, R., Halevy, A.: Minicon: A scalable algorithm for answering queries using views. The VLDB Journal 10(2-3), 182–198 (2001)
Rizzi, S., Saltarelli, E.: View materialization vs. indexing: Balancing space constraints in data warehouse design. In: Eder, J., Missikoff, M. (eds.) CAiSE 2003. LNCS, vol. 2681, pp. 502–519. Springer, Heidelberg (2003)
Surajit Chaudhuri, M., Vardi, M.Y.: Optimization of real conjunctive queries. In: PODS 1993, pp. 59–70 (1993)
Theodoratos, D., Sellis, T.K.: Data warehouse configuration. In: VLDB 1997, pp. 126–135 (1997)
Theodoratos, D., Xu, W.: Constructing search spaces for materialized view selection. In: DOLAP, pp. 112–121 (2004)
Ullman, J.D., Garcia-Molina, H., Widom, J.: Database Systems: The Complete Book. Prentice Hall PTR, Upper Saddle River (2001)
Xu, W., Theodoratos, D., Zuzarte, C.: Computing closest common subexpressions for view selection problems. In: DOLAP, pp. 75–82 (2006)
Yu, J.X., Choi, C.-H., Gou, G., Lu, H.: Selecting views with maintenance cost constraints: Issues, heuristics and performance. Journal of Research and Practice in Information Technology 36(2), 89–110 (2004)
Zhou, J., Larson, P.-A., Freytag, J.C., Lehner, W.: Efficient exploitation of similar subexpressions for query processing. In: SIGMOD Conference, pp. 533–544 (2007)
Zoghbi, A., Stojmenović, I.: Fast algorithms for generating integer partitions. Int. J. Comput. Math. 70(2), 319–332 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Afrati, F., Damigos, M., Gergatsoulis, M. (2009). On Solving Efficiently the View Selection Problem under Bag-Semantics. In: Castellanos, M., Dayal, U., Sellis, T. (eds) Business Intelligence for the Real-Time Enterprise. BIRTE 2008. Lecture Notes in Business Information Processing, vol 27. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03422-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-03422-0_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03421-3
Online ISBN: 978-3-642-03422-0
eBook Packages: Computer ScienceComputer Science (R0)