Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1007/978-3-030-86534-4_4guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Selecting Subexpressions to Materialize for Dynamic Large-Scale Workloads

Published: 27 September 2021 Publication History

Abstract

The nature of analytical queries executed either inside or outside of a DBMS increases the redundant computations due to the presence of common query sub-expressions. More recently, a few largely industry-led studies have focussed on the problem of identifying beneficial sub-expressions for large-scale workloads running outside of a DBMS for materialization purposes. However, these works have unfortunately ignored the large-scale workloads running inside of a DBMS. To align them in terms of the materialization of beneficial sub-expressions for dynamic large-scale workloads, we propose a pro-active approach that uses hypergraphs. These structures exploit cost models towards capturing the common query sub-expressions and materializing the most beneficial ones. Our approach is accompanied by a strategy, which orients the first δ queries to the offline phase that selects their appropriate views. To augment the benefit and sharing of the selected views, the initial δ queries may be scheduled. The online phase manages the pool of views obtained by the first phase by adding/dropping views to optimize new incoming queries. We conducted extensive experiments to evaluate the efficiency of our proposal as well as its cost-effective integration in a commercial DBMS.

References

[1]
Ahmed R, Bello RG, Witkowski A, and Kumar P Automated generation of materialized views in oracle Proc. VLDB Endow. 2020 13 12 3046-3058
[2]
Bhargava, G., Goel, P., Iyer, B.R.: Hypergraph based reorderings of outer join queries with complex predicates. In: SIGMOD, pp. 304–315 (1995)
[3]
Boukorca, A., Bellatreche, L., Cuzzocrea, A.: SLEMAS: an approach for selecting materialized views under query scheduling constraints. In: COMAD, pp. 66–73 (2014)
[4]
Boukorca A, Bellatreche L, Senouci SB, and Faget Z Coupling materialized view selection to multi query optimization: hyper graph approach IJDWM 2015 11 2 62-84
[5]
Bretto A Hypergraph Theory: An Introduction 2013 Heidelberg Springer
[6]
Chaiken R et al. SCOPE: easy and efficient parallel processing of massive data sets Proc. VLDB Endow. 2008 1 2 1265-1276
[7]
Gupta H and Mumick IS Beeri C and Buneman P Selection of views to materialize under a maintenance cost constraint Database Theory—ICDT 1999 1999 Heidelberg Springer 453-470
[8]
Jindal A, Karanasos K, Rao S, and Patel H Selecting subexpressions to materialize at datacenter scale Proc. VLDB Endow. 2018 11 7 800-812
[9]
Karypis, G., Aggarwal, R., Kumar, V., Shekhar, S.: Multilevel hypergraph partitioning: application in VLSI domain, pp. 526–529 (1997)
[10]
Kathuria, T., Sudarshan, S.: Efficient and provable multi-query optimization. In: PODS, pp. 53–67 (2017)
[11]
Kotidis, Y., Roussopoulos, N.: DynaMat: a dynamic view management system for data warehouses. In: SIGMOD, pp. 371–382 (1999)
[12]
Mami I and Bellahsene Z A survey of view selection methods ACM SIGMOD Rec. 2012 41 1 20-29
[13]
Mouna, M.C., Bellatreche, L., Boustia, N.: HYRAQ: optimizing large-scale analytical queries through dynamic hypergraphs. In: IDEAS, pp. 17:1–17:10 (2020)
[14]
Pavlo A et al. External vs. internal: an essay on machine learning agents for autonomous database management systems IEEE Data Eng. Bull. 2019 42 2 32-46
[15]
Perez, L.L., Jermaine, C.M.: History-aware query optimization with materialized intermediate views. In: ICDE, pp. 520–531 (2014)
[16]
Phan, T., Li, W.: Dynamic materialization of query views for data warehouse workloads. In: ICDE, pp. 436–445 (2008)
[17]
Roukh A, Bellatreche L, Bouarar S, and Boukorca A Eco-physic: eco-physical design initiative for very large databases Inf. Syst. 2017 68 44-63
[18]
Roy P and Sudarshan S Liu L and Özsu MT Multi-query optimization Encyclopedia of Database Systems 2018 New York Springer
[19]
Savva F, Anagnostopoulos C, and Triantafillou P Adaptive learning of aggregate analytics under dynamic workloads Future Gener. Comput. Syst. 2020 109 317-330
[20]
Scheuermann, P., Shim, J., Vingralek, R.: WATCHMAN: a data warehouse intelligent cache manager. In: VLDB, pp. 51–62 (1996)
[21]
Sellis T Multiple-query optimization ACM TODS 1988 13 1 23-52
[22]
Silva, Y.N., Larson, P., Zhou, J.: Exploiting common subexpressions for cloud query processing. In: ICDE, pp. 1337–1348 (2012)
[23]
Timos K and Sellis SG On the multiple query optimization problem IEEE Trans. Knowl. Data Eng. 1990 2 262-266
[24]
Yang, J., Karlapalem, K., Li, Q.: Algorithms for materialized view design in data warehousing environment. In: VLDB, pp. 136–145 (1997)
[25]
Yu, X., Li, G., Chai, C., Tang, N.: Reinforcement learning with tree-LSTM for join order selection. In: ICDE, pp. 1297–1308 (2020)
[26]
Yuan, H., Li, G., Feng, L., Sun, J., Han, Y.: Automatic view generation with deep learning and reinforcement learning. In: ICDE, pp. 1501–1512 (2020)

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings
Big Data Analytics and Knowledge Discovery: 23rd International Conference, DaWaK 2021, Virtual Event, September 27–30, 2021, Proceedings
Sep 2021
282 pages
ISBN:978-3-030-86533-7
DOI:10.1007/978-3-030-86534-4

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 27 September 2021

Author Tags

  1. Query interaction
  2. Dynamic hypergraphs
  3. View selection

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 0
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 20 Nov 2024

Other Metrics

Citations

View Options

View options

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media