Algebraic incremental maintenance of XML views
Proceedings of the 14th International Conference on Extending Database Technology
Materialized view selection for XQuery workloads
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Revisiting answering tree pattern queries using views
ACM Transactions on Database Systems (TODS)
Answering queries using views over probabilistic XML: complexity and tractability
Proceedings of the VLDB Endowment
ViP2P: efficient XML management in DHT networks
ICWE'12 Proceedings of the 12th international conference on Web Engineering
Web data indexing in the cloud: efficiency and cost reductions
Proceedings of the 16th International Conference on Extending Database Technology
Algebraic incremental maintenance of XML views
ACM Transactions on Database Systems (TODS)
Growing triples on trees: an XML-RDF hybrid model for annotated documents
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
We consider the problem of rewriting XQuery queries using multiple materialized XQuery views. The XQuery dialect we use to express views and queries corresponds to tree patterns (returning data from several nodes, at different granularities, ranging from node identifiers to full XML subtrees) with value joins. We provide correct and complete algorithms for finding minimal rewritings, in which no view is redundant. Our work extends the state of the art by considering more flexible views than the mostly XPath 1.0 dialects previously considered, and more powerful rewritings. We implemented our algorithms and assess their performance through a set of experiments.