Incremental maintenance of materialized views

Mukesh Mohania, Shin’ichi Konomi, Yahiko Kambayashi

研究成果: 著書/レポートタイプへの貢献会議での発言

16 引用 (Scopus)

抄録

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.

元の言語英語
ホスト出版物のタイトルDatabase and Expert Systems Applications - 8th International Conference, DEXA 1997, Proceedings
編集者A. Min Tjoa, Abdelkader Hameurlain
出版者Springer Verlag
ページ551-560
ページ数10
ISBN(印刷物)3540634789, 9783540634782
出版物ステータス出版済み - 1 1 1997
外部発表Yes
イベント8th International Conference on Database and Expert Systems Applications, DEXA 1997 - Toulouse, フランス
継続期間: 9 1 19979 5 1997

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
1308
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

その他

その他8th International Conference on Database and Expert Systems Applications, DEXA 1997
フランス
Toulouse
期間9/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)

これを引用

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

Incremental maintenance of materialized views. / Mohania, Mukesh; Konomi, Shin’ichi; Kambayashi, Yahiko.

Database and Expert Systems Applications - 8th International Conference, DEXA 1997, Proceedings. 版 / A. Min Tjoa; Abdelkader Hameurlain. Springer Verlag, 1997. p. 551-560 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻 1308).

研究成果: 著書/レポートタイプへの貢献会議での発言

Mohania, M, Konomi, S & Kambayashi, Y 1997, Incremental maintenance of materialized views. : AM Tjoa & A Hameurlain (版), Database and Expert Systems Applications - 8th International Conference, DEXA 1997, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 巻. 1308, Springer Verlag, pp. 551-560, 8th International Conference on Database and Expert Systems Applications, DEXA 1997, Toulouse, フランス, 9/1/97.
Mohania M, Konomi S, Kambayashi Y. Incremental maintenance of materialized views. : Tjoa AM, Hameurlain A, 編集者, Database and Expert Systems Applications - 8th International Conference, DEXA 1997, Proceedings. 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, Shin’ichi ; Kambayashi, Yahiko. / Incremental maintenance of materialized views. Database and Expert Systems Applications - 8th International Conference, DEXA 1997, Proceedings. 編集者 / A. Min Tjoa ; Abdelkader Hameurlain. 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 Shin’ichi Konomi and Yahiko Kambayashi",
year = "1997",
month = "1",
day = "1",
language = "English",
isbn = "3540634789",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "551--560",
editor = "Tjoa, {A. Min} and Abdelkader Hameurlain",
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, Shin’ichi

AU - Kambayashi, Yahiko

PY - 1997/1/1

Y1 - 1997/1/1

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

AN - SCOPUS:84947715884

SN - 3540634789

SN - 9783540634782

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

A2 - Tjoa, A. Min

A2 - Hameurlain, Abdelkader

PB - Springer Verlag

ER -