Jun 13, 2008 · The standard approach for optimization of XPath queries by rewrit- ing using views techniques consists in navigating inside a view's output, ...
We identify the tightest restrictions under which an XPath can be rewritten in polynomial time using an in- tersection of views and propose an algorithm that ...
TL;DR: This work provides correct and complete algorithms for finding minimal rewritings, in which no view is redundant, on the problem of rewriting XQuery ...
For the problem of multiple-view rewriting, we first refine the materialized fragments of each selected view (like pushing selection), we then join the refined ...
Query rewriting using views is a technique that allows a query to be answered efficiently by using pre-computed materialized views. It has many applications ...
Missing: Multiple Achieving
The standard approach for optimization of XPath queries by rewriting using views ... XPath Rewriting Using Multiple Views: Achieving Completeness and Efficiency.
Abstract— We study the problem of answering XPATH queries using multiple materialized views. Despite the efforts on answer-.
XPath rewriting using multiple views: Achieving completeness and efficiency. In WebDB, 2008. [8] B. Cautis, A. Deutsch, and N. Onose. Querying data sources ...
We study the problem of answering queries posed on virtual views of XML documents, a problem commonly en- countered when enforcing XML access control and ...
Missing: Achieving | Show results with:Achieving
Mar 24, 2009 · ABSTRACT. The problem of rewriting a query using a materialized view is studied for a well known fragment of XPath that includes.