Affiliation:
1. Data Structuring Group, Department of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1
Abstract
Query processing can be sped up by keeping frequently accessed users' views materialized. However, the need to access base relations in response to queries can be avoided only if the materialized view is adequately maintained. We propose a method in which all database updates to base relations are first filtered to remove from consideration those that cannot possibly affect the view. The conditions given for the detection of updates of this type, called
irrelevant updates
, are necessary and sufficient and are independent of the database state. For the remaining database updates, a
differential
algorithm can be applied to re-evaluate the view expression. The algorithm proposed exploits the knowledge provided by both the view definition expression and the database update operations.
Publisher
Association for Computing Machinery (ACM)
Subject
Information Systems,Software
Cited by
105 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Continuous Data Ingestion and Transformation in Snowflake;Proceedings of the 18th ACM International Conference on Distributed and Event-based Systems;2024-06-24
2. Reactive Dataflow for Inflight Error Handling in ML Workflows;Proceedings of the Eighth Workshop on Data Management for End-to-End Machine Learning;2024-06-09
3. Caching in Forschung und Industrie;Schnelles und skalierbares Cloud-Datenmanagement;2024
4. Workload-Aware Cache Management of Bitmap Indices;Proceedings of the IEEE/ACM 10th International Conference on Big Data Computing, Applications and Technologies;2023-12-04
5. Keep Your Distributed Data Warehouse Consistent at a Minimal Cost;Proceedings of the ACM on Management of Data;2023-06-13