An efficient procedure for maintaining materialized views on distributed database systems

✍ Scribed by Takeya Kasukawa; Michio Nakanishi; Hideo Matsuda; Akihiro Hashimoto

• Publisher: John Wiley and Sons
• Year: 2000
• Tongue: English
• Weight: 265 KB
• Volume: 31
• Category: Article
• ISSN: 0882-1666
• DOI: 10.1002/(sici)1520-684x(200005)31:5<86::aid-scj8>3.0.co;2-w

✦ Synopsis

This paper considers a distributed database represented by the relational model, and proposes an efficient procedure to reflect the update of the base relation for materialized views defined by the inequality query from the base relation in the element database. Methods to reflect updates of the base relation on the materialized views in the distributed database include a method that calculates the tuple inserted or deleted for the materialized view due to the update of the base relation, using the existing query processing procedure, as well as a method that stores the copy of the base relation to be utilized in the database containing the materialized view. The method proposed in the paper is to store and utilize the key attribute value of the tuple satisfying a part of the inequality query condition as the materialized view, independently of the originally considered materialized view. By this mechanism, the communication cost in query processing can be reduced. The required memory area can also be reduced, compared to the case where the copy of the base relation is directly stored. This paper shows the validity of the proposed method, and compares the communication cost and the amount of data to be stored, versus the existing method. It is also shown that the proposed method is useful in the database for molecular biology.