Incremental maintenance of materialized views

Mukesh Mohania, Shinichi Konomi, Yahiko Kambayashi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Citations (Scopus)

Abstract

Materialized views are important in databases, particularly in data warehouses, where they are used to speed up query processing on large amounts of data. These views need to be maintained incrementally in response to database updates. In this paper we investigate the problem of incremental maintenance of a materialized view in response to changes to the base data. We show that a materialized view can be maintained without accessing the view itself by materializing additional relations. We firstly give an algorithm for determining what additional relations need to be materialize in order to maintain a view incrementally. We then propose an algorithm for updating the materialized view (and the additional relations) based on the optimized operator tree used for evaluating the view as a query. A materialized view is updated by propagating updates to the nodes of its operator tree in a bottom-up fashion, where each node contains a relational algebraic operator and computes an intermediate expression. Our algorithm derives the exact update at every intermediate node in the tree, including the materialized view. Finally, we compare our incremental algorithm with the naive algorithm that recomputes the view from scratch.

Original languageEnglish
Title of host publicationDatabase and Expert Systems Applications - 8th International Conference, DEXA 1997, Proceedings
PublisherSpringer Verlag
Pages551-560
Number of pages10
Volume1308
ISBN (Print)3540634789, 9783540634782
Publication statusPublished - 1997
Externally publishedYes
Event8th International Conference on Database and Expert Systems Applications, DEXA 1997 - Toulouse, France
Duration: Sep 1 1997Sep 5 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1308
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other8th International Conference on Database and Expert Systems Applications, DEXA 1997
CountryFrance
CityToulouse
Period9/1/979/5/97

Fingerprint

Maintenance
Update
Vertex of a graph
Operator
Incremental Algorithm
Data Warehouse
Query Processing
Bottom-up
Data warehouses
Query processing
Updating
Speedup
Query
Mathematical operators

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Mohania, M., Konomi, S., & Kambayashi, Y. (1997). Incremental maintenance of materialized views. In Database and Expert Systems Applications - 8th International Conference, DEXA 1997, Proceedings (Vol. 1308, pp. 551-560). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1308). Springer Verlag.

Incremental maintenance of materialized views. / Mohania, Mukesh; Konomi, Shinichi; Kambayashi, Yahiko.

Database and Expert Systems Applications - 8th International Conference, DEXA 1997, Proceedings. Vol. 1308 Springer Verlag, 1997. p. 551-560 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1308).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Mohania, M, Konomi, S & Kambayashi, Y 1997, Incremental maintenance of materialized views. in Database and Expert Systems Applications - 8th International Conference, DEXA 1997, Proceedings. vol. 1308, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1308, Springer Verlag, pp. 551-560, 8th International Conference on Database and Expert Systems Applications, DEXA 1997, Toulouse, France, 9/1/97.
Mohania M, Konomi S, Kambayashi Y. Incremental maintenance of materialized views. In Database and Expert Systems Applications - 8th International Conference, DEXA 1997, Proceedings. Vol. 1308. Springer Verlag. 1997. p. 551-560. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Mohania, Mukesh ; Konomi, Shinichi ; Kambayashi, Yahiko. / Incremental maintenance of materialized views. Database and Expert Systems Applications - 8th International Conference, DEXA 1997, Proceedings. Vol. 1308 Springer Verlag, 1997. pp. 551-560 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{2d294189c0ff4c3e8f3d59647e7d72a6,
title = "Incremental maintenance of materialized views",
abstract = "Materialized views are important in databases, particularly in data warehouses, where they are used to speed up query processing on large amounts of data. These views need to be maintained incrementally in response to database updates. In this paper we investigate the problem of incremental maintenance of a materialized view in response to changes to the base data. We show that a materialized view can be maintained without accessing the view itself by materializing additional relations. We firstly give an algorithm for determining what additional relations need to be materialize in order to maintain a view incrementally. We then propose an algorithm for updating the materialized view (and the additional relations) based on the optimized operator tree used for evaluating the view as a query. A materialized view is updated by propagating updates to the nodes of its operator tree in a bottom-up fashion, where each node contains a relational algebraic operator and computes an intermediate expression. Our algorithm derives the exact update at every intermediate node in the tree, including the materialized view. Finally, we compare our incremental algorithm with the naive algorithm that recomputes the view from scratch.",
author = "Mukesh Mohania and Shinichi Konomi and Yahiko Kambayashi",
year = "1997",
language = "English",
isbn = "3540634789",
volume = "1308",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "551--560",
booktitle = "Database and Expert Systems Applications - 8th International Conference, DEXA 1997, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Incremental maintenance of materialized views

AU - Mohania, Mukesh

AU - Konomi, Shinichi

AU - Kambayashi, Yahiko

PY - 1997

Y1 - 1997

N2 - Materialized views are important in databases, particularly in data warehouses, where they are used to speed up query processing on large amounts of data. These views need to be maintained incrementally in response to database updates. In this paper we investigate the problem of incremental maintenance of a materialized view in response to changes to the base data. We show that a materialized view can be maintained without accessing the view itself by materializing additional relations. We firstly give an algorithm for determining what additional relations need to be materialize in order to maintain a view incrementally. We then propose an algorithm for updating the materialized view (and the additional relations) based on the optimized operator tree used for evaluating the view as a query. A materialized view is updated by propagating updates to the nodes of its operator tree in a bottom-up fashion, where each node contains a relational algebraic operator and computes an intermediate expression. Our algorithm derives the exact update at every intermediate node in the tree, including the materialized view. Finally, we compare our incremental algorithm with the naive algorithm that recomputes the view from scratch.

AB - Materialized views are important in databases, particularly in data warehouses, where they are used to speed up query processing on large amounts of data. These views need to be maintained incrementally in response to database updates. In this paper we investigate the problem of incremental maintenance of a materialized view in response to changes to the base data. We show that a materialized view can be maintained without accessing the view itself by materializing additional relations. We firstly give an algorithm for determining what additional relations need to be materialize in order to maintain a view incrementally. We then propose an algorithm for updating the materialized view (and the additional relations) based on the optimized operator tree used for evaluating the view as a query. A materialized view is updated by propagating updates to the nodes of its operator tree in a bottom-up fashion, where each node contains a relational algebraic operator and computes an intermediate expression. Our algorithm derives the exact update at every intermediate node in the tree, including the materialized view. Finally, we compare our incremental algorithm with the naive algorithm that recomputes the view from scratch.

UR - http://www.scopus.com/inward/record.url?scp=84947715884&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947715884&partnerID=8YFLogxK

M3 - Conference contribution

SN - 3540634789

SN - 9783540634782

VL - 1308

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 551

EP - 560

BT - Database and Expert Systems Applications - 8th International Conference, DEXA 1997, Proceedings

PB - Springer Verlag

ER -