An algorithm for incremental maintenance of materialized XPath view

Authors:
Xueyun Jin;Husheng Liao
Affiliations:
College of Computer Science and Technology, Beijing University of Technology, Beijing, China;College of Computer Science and Technology, Beijing University of Technology, Beijing, China
Venue:
WAIM'10 Proceedings of the 11th international conference on Web-age information management
Year:
2010

Citing 7
Cited 0

Efficiently updating materialized views

SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Maintaining views incrementally

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Systematic derivation of incremental programs

Science of Computer Programming
Incremental maintenance for materialized XPath/XSLT views

WWW '05 Proceedings of the 14th international conference on World Wide Web
Incremental maintenance of path-expression views

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Incremental evaluation of a monotone XPath fragment

Proceedings of the 14th ACM international conference on Information and knowledge management
Incremental XPath evaluation

Proceedings of the 12th International Conference on Database Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cached materialized view has lots of benefits, but it has inconsistency problem when the data source is modified. This paper proposes an incremental maintenance algorithm IMA to implement incremental maintenance of materialized XPath view. The characteristics of IMA are: (1) It can establish an incremental maintenance program automatically; (2) The incremental maintenance program is simple and its function is reassembling the materialized XPath view to obtain a consistent view; (3) The incremental maintenance program is written in XQuery language and can be executed by any XQuery engine; (4) The only auxiliary data used to maintain the materialized XPath view is the incremental maintenance program and its size cost is very small. Experiments have shown that this approach outperforms view recomputation.