Semistructured data is not strictly typed like relational or object-oriented data and may be irregular or incomplete. It often arises in practice, e.g., when heterogeneous data sources are integrated or data is taken from the World Wide Web. Views over semistructured data can be used to filter the data and to restructure (or provide structure to) it. To achieve fast query response time, these views are often materialized. This paper studies incremental maintenance techniques for materialized views over semistructured data. We use the graph-based data model OEM and the query language Lorel, developed at Stanford, as the framework for our work. We propose a new algorithm that produces a set of queries that compute the changes to the view based upon a change to the source. We develop an analytic cost model and compare the cost of executing our incremental maintenance algorithm to that of recomputing the view. We show that for nearly all types of database updates, it is more efficient to apply our incremental maintenance algorithm to the view than to recompute the view from the database, even when there are thousands of such updates.

@inproceedings{abiteboul1998incremental, author = {Abiteboul, S. and McHugh, J. and Rys, M. and Vassalos, V. and Wiener, J.}, title = {Incremental Maintenance for Materialized Views over Semistructured Data}, booktitle = {24rd International Conference on Very Large Data Bases}, publisher = {Morgan Kaufmann}, year = {1998}, pages = {38--49}, url = {http://ilpubs.stanford.edu:8090/340/}, keywords = {data, database, incremental, query, update, view}, abstract = {Semistructured data is not strictly typed like relational or object-oriented data and may be irregular or incomplete. It often arises in practice, e.g., when heterogeneous data sources are integrated or data is taken from the World Wide Web. Views over semistructured data can be used to filter the data and to restructure (or provide structure to) it. To achieve fast query response time, these views are often materialized. This paper studies incremental maintenance techniques for materialized views over semistructured data. We use the graph-based data model OEM and the query language Lorel, developed at Stanford, as the framework for our work. We propose a new algorithm that produces a set of queries that compute the changes to the view based upon a change to the source. We develop an analytic cost model and compare the cost of executing our incremental maintenance algorithm to that of recomputing the view. We show that for nearly all types of database updates, it is more efficient to apply our incremental maintenance algorithm to the view than to recompute the view from the database, even when there are thousands of such updates.} }

%0 = inproceedings %A = Abiteboul, S. and McHugh, J. and Rys, M. and Vassalos, V. and Wiener, J. %B = 24rd International Conference on Very Large Data Bases %D = 1998 %I = Morgan Kaufmann %T = Incremental Maintenance for Materialized Views over Semistructured Data %U = http://ilpubs.stanford.edu:8090/340/