On maximal contained rewriting of tree pattern queries using views

Authors:
Junhu Wang;Jeffrey Xu Yu
Affiliations:
School of Information and Communication Technology, Griffith University, Gold Coast, Australia;Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, China
Venue:
WISE'10 Proceedings of the 11th international conference on Web information systems engineering
Year:
2010

Citing 16
Cited 1

Minimization of tree pattern queries

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Holistic twig joins: optimal XML pattern matching

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Answering queries using views: A survey

The VLDB Journal — The International Journal on Very Large Data Bases
Containment and equivalence for a fragment of XPath

Journal of the ACM (JACM)
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
Answering tree pattern queries using views

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Structured materialized views for XML queries

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Contained Rewritings of XPath Queries Using Views Revisited

WISE '08 Proceedings of the 9th international conference on Web Information Systems Engineering
XPath Rewriting Using Multiple Views

DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Independence of Containing Patterns Property and Its Application in Tree Pattern Query Rewriting Using Views

World Wide Web
On rewriting XPath queries using views

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Finding Irredundant Contained Rewritings of Tree Pattern Queries Using Views

APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
Answering XML queries using materialized views revisited

Proceedings of the 18th ACM conference on Information and knowledge management
Efficient rewriting of XPath queries using Query Set Specifications

Proceedings of the VLDB Endowment
Query rewritings using views for XPath queries, framework, and methodologies

Information Systems

Revisiting answering tree pattern queries using views

ACM Transactions on Database Systems (TODS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of rewriting tree pattern queries using views has attracted much attention in recent years. Previous works have proposed algorithms for finding the maximal contained rewriting using views when the query and the view are limited to some special cases, e.g., tree patterns not having the wildcard *. In the general case, i.e, when both //-edges and * are present, the previous methods may fail to find the maximal contained rewriting. In this paper, we propose a method to find the maximal contained rewriting for the general case, as well as an extension of the previous method to more special cases.