Sciweavers

269 search results - page 1 / 54
» On Tree Pattern Query Rewriting Using Views
Sort
View
WAIM
2009
Springer
13 years 11 months ago
Finding Irredundant Contained Rewritings of Tree Pattern Queries Using Views
Contained rewriting and maximal contained rewriting of tree pattern queries using views have been studied recently for the class of tree patterns involving /, //, and []. Given que...
Junhu Wang, Kewen Wang, Jiuyong Li
WISE
2007
Springer
13 years 10 months ago
On Tree Pattern Query Rewriting Using Views
We study and present our findings on two closely related problems on xpath rewriting using views when both the view and the query are tree patterns involving /,// and []. First, g...
Junhu Wang, Jeffrey Xu Yu, Chengfei Liu
VLDB
2007
ACM
152views Database» more  VLDB 2007»
14 years 4 months ago
Structured Materialized Views for XML Queries
The performance of XML database queries can be greatly enhanced by rewriting them using materialized views. We study the problem of rewriting a query using materialized views, whe...
Andrei Arion, Ioana Manolescu, Véronique Be...
SIGMOD
2006
ACM
121views Database» more  SIGMOD 2006»
14 years 4 months ago
Rewriting nested XML queries using nested views
We present and analyze an algorithm for equivalent rewriting of XQuery queries using XQuery views, which is complete for a large class of XQueries featuring nested FLWR blocks, XM...
Nicola Onose, Alin Deutsch, Yannis Papakonstantino...
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
14 years 4 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan