Efficiently updating materialized views dblp

Working in the framework developed by [DS93, Pat Imm94] for dynamic query evaluation, we show that dynamic tree isomorphism can be performed via first-order updates to a relational database (in [DS93] this framework is called a first-order incremental evaluation system , and in [Pat Imm94] it is called Dyn-FO ).

In [EI95] it was shown that tree-isomorphism can not be expressed in first-order logic augmented with a transitive closure operator and counting, (FO TC COUNT) (but without ordering).

The latter can significantly increase the amount of data that can be expired.

We present efficient algorithms for determining what data can be expired (data not needed for maintenance of other views), taking into account the types of updates that may occur.

Mc Bride, Yechiam Yemini, Shaula Yemini: Towards a new distributed programming environment (CORDS).

Mc Bride, Yechiam Yemini, Shaula Yemini: Distributed Programming Environment: Challenges.

Carey, David Rieber, Steve Kirsch, Michael Blow, John C.

In this paper our main focus will be a particular dynamic graph problem, tree isomorphism, and the efficiency of our update scheme will be measured in terms of how expressive a query language is required to express our update.We investigate the problem of incremental maintenance of materialized XML views.We are considering the case where the underlying database is a relational database and the view exposed to querying is a materialized XML view. IBM Systems Journal 34(1): 39-62 (1995)Jacob Slonim, Michael A. Computer Communication Review 34(5): 59-74 (2004)Gopi K. Bradshaw, Neil Coburn, Per-Åke Larson, Patrick Martin, Abraham Silberschatz, Jacob Slonim, Qiang Zhu: The CORDS Multidatabase Project. IBM Systems Journal 33(3): 399-425 (1994)Ann Gawman, Evelyn Kidd, Per-Åke Larson: Proceedings of the 1993 Conference of the Centre for Advanced Studies on Collaborative Research, October 24-28, 1993, Toronto, Ontario, Canada, 2 Volumes IBM 1993Jacob Slonim, Patrick J. Kersten, Per-Åke Larson, Beng Chin Ooi: Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30 - September 2, 20Yi-Min Wang, Lili Qiu, Chad Verbowski, Dimitris Achlioptas, Gautam Das, Per-Åke Larson: Summary-based routing for content-based event distribution networks. Teorey: A Distributed System Architecture for a Distributed Application Environment.

You must have an account to comment. Please register or login here!