Affiliation:
1. IBM Almaden Research Center, San Jose, CA
Abstract
We investigate the problem of using materialized views to answer SQL queries. We focus on modern decision-support queries, which involve joins, arithmetic operations and other (possibly user-defined) functions, aggregation (often along multiple dimensions), and nested subqueries. Given the complexity of such queries, the vast amounts of data upon which they operate, and the requirement for interactive response times, the use of materialized views (MVs) of similar complexity is often mandatory for acceptable performance. We present a novel algorithm that is able to rewrite a user query so that it will access one or more of the available MVs instead of the base tables. The algorithm extends prior work by addressing the new sources of complexity mentioned above, that is, complex expressions, multidimensional aggregation, and nested subqueries. It does so by relying on a graphical representation of queries and a bottom-up, pair-wise matching of nodes from the query and MV graphs. This approach offers great modularity and extensibility, allowing for the rewriting of a large class of queries.
Publisher
Association for Computing Machinery (ACM)
Subject
Information Systems,Software
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Optimizing Data Pipelines for Machine Learning in Feature Stores;Proceedings of the VLDB Endowment;2023-09
2. COMPARE;Proceedings of the VLDB Endowment;2021-07
3. Incremental join view maintenance on distributed log-structured storage;Frontiers of Computer Science;2021-01-22
4. ProvCite;Proceedings of the VLDB Endowment;2019-03
5. Interactive summarization and exploration of top aggregate query answers;Proceedings of the VLDB Endowment;2018-09-01