XML query processing using views

Authors:
Caiyun Yao;Jiaheng Lu;Wei Wang;Xiaofang Zhou
Affiliations:
School of Information, Renmin University of China, China;School of Information, Renmin University of China, China;School of Computer Science and Engineering, University of New South Wales, Australia;School of Information, Renmin University of China, China and School of Information Technology and Electrical Engineering, University of Queensland, Australia
Venue:
WAIM'11 Proceedings of the 2011 international conference on Web-Age Information Management
Year:
2011

Citing 9
Cited 0

Minimization of tree pattern queries

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Covering indexes for branching path queries

Proceedings of the 2002 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
Anatomy of a native XML base management system

The VLDB Journal — The International Journal on Very Large Data Bases
Answering queries using views: A survey

The VLDB Journal — The International Journal on Very Large Data Bases
Rewriting XPath queries using materialized views

VLDB '05 Proceedings of the 31st international conference on Very large data bases
From region encoding to extended dewey: on efficient processing of XML twig pattern matching

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
Multiple Materialized View Selection for XPath Query Rewriting

ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. More recently, there is growing attention on applying materialized views, which is an established and effective optimization technique in relational database systems, to TPQ matching. We study the query answering using views problem for tree pattern queries (QAV). The QAV problem is traditionally formulated in two ways: (i) find a maximal result, or (ii) find an equivalent result. For the former, there exists an idea of searching for a maximal contained rewriting, by applying some compensation to the result of view. Because not all the answers will be returned, some useful answers may be missing. Motivated by this, we study the latter one--finding an equivalent rewriting of tree pattern queries. We mainly focus on path query.