Properties and update semantics of consistent views
ACM Transactions on Database Systems (TODS)
Maintaining views incrementally
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Update semantics of relational views
ACM Transactions on Database Systems (TODS)
Tree pattern query minimization
The VLDB Journal — The International Journal on Very Large Data Bases
Incremental validation of XML documents
ACM Transactions on Database Systems (TODS)
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
Rewriting XPath queries using materialized views
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Query caching and view selection for XML databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
An Efficient XPath Query Processor for XML Streams
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Incremental Maintenance of Materialized XQuery Views
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Relational lenses: a language for updatable views
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Rewriting nested XML queries using nested views
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Maintaining XPath views in loosely coupled systems
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
XMark: a benchmark for XML data management
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
A framework for using materialized XPath views in XML query processing
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Efficient maintenance techniques for views over active documents
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Updating recursive XML views of relations
Journal of Computer Science and Technology
Multiple Materialized View Selection for XPath Query Rewriting
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
DDE: from dewey to a fully dynamic XML labeling scheme
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Schema-based independence analysis for XML updates
Proceedings of the VLDB Endowment
Destabilizers and independence of XML updates
Proceedings of the VLDB Endowment
Efficient XQuery rewriting using multiple views
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Verification of tree updates for optimization
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
XPathMark: an XPath benchmark for the XMark generated data
XSym'05 Proceedings of the Third international conference on Database and XML Technologies
Algebra-Based identification of tree patterns in XQuery
FQAS'06 Proceedings of the 7th international conference on Flexible Query Answering Systems
Revisiting answering tree pattern queries using views
ACM Transactions on Database Systems (TODS)
Algebraic incremental maintenance of XML views
ACM Transactions on Database Systems (TODS)
Hi-index | 0.00 |
Materialized views can bring important performance benefits when querying XML documents. In the presence of XML document changes, materialized views need to be updated to faithfully reflect the changed document. In this work, we present an algebraic approach for propagating source updates to XML materialized views expressed in a powerful XML tree pattern formalism. Our approach differs from the state of the art in the area in two important ways. First, it relies on set-oriented, algebraic operations, to be contrasted with node-based previous approaches. Second, it exploits state-of-the-art features of XML stores and XML query evaluation engines, notably XML structural identifiers and associated structural join algorithms. We present algorithms for determining how updates should be propagated to views, and highlight the benefits of our approach over existing algorithms through a series of experiments.