Efficiently updating materialized views

  • Authors:

  • Jose A. Blakeley;Per-Ake Larson;Frank Wm Tompa

  • Affiliations:

  • Data Structuring Group, Department of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1;Data Structuring Group, Department of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1;Data Structuring Group, Department of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1

  • Venue:
  • SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
  • Year:
  • 1986

Quantified Score

Hi-index 0.07

Visualization

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.