Evaluating irredundant maximal contained rewritings for XPath queries on views

Zhou, Rui, Liu, Chengfei, Li, Jianxin, Wang, Junhu and Yu, Jeffrey Xu 2014, Evaluating irredundant maximal contained rewritings for XPath queries on views, Computer journal, vol. 57, no. 11, pp. 1674-1692, doi: 10.1093/comjnl/bxt091.

Attached Files
Name Description MIMEType Size Downloads

Title Evaluating irredundant maximal contained rewritings for XPath queries on views
Author(s) Zhou, Rui
Liu, Chengfei
Li, JianxinORCID iD for Li, Jianxin orcid.org/0000-0002-9059-330X
Wang, Junhu
Yu, Jeffrey Xu
Journal name Computer journal
Volume number 57
Issue number 11
Start page 1674
End page 1692
Total pages 19
Publisher Oxford University Press
Place of publication Oxford, Eng.
Publication date 2014-11
Keyword(s) algorithm
query rewriting
Science & Technology
Hardware & Architecture
Information Systems
Software Engineering
Computer Science
Summary We review the problem of finding contained rewritings (CRs) for XPath queries using XPath views. CR is proposed to cater for data integration scenarios, where views are unlikely to be complete due to the limited coverage of data sources, and hence equivalent rewritings are impossible to be found. As a result, we are usually required to find a maximal contained rewriting (MCR) for a query to provide the best possible answers. An MCR is a set of CRs, and may contain redundant CRs. Obviously, evaluating redundant CRs on materialized views is unnecessary. In this paper, we first address how to find the irredundant maximal contained rewriting (IMCR), i.e. all the irredundant CRs. We show that the existing approach ignores a type of situation, and turns out to be not sufficient. As a result, the only safe solution is a brute-force pairwise containment check for all the CRs. We then propose some heuristics to speed up the brute-force comparisons. When a materialized view is given, we propose how to evaluate the IMCR on the materialized view, which, to our knowledge, is the first work on optimizing the evaluation of a set of produced CRs on the materialized view by considering the inherent structural characteristics of the CRs. Our experiments show the effectiveness and efficiency of our algorithms.
Language eng
DOI 10.1093/comjnl/bxt091
Field of Research 08 Information and Computing Sciences
HERDC Research category C1.1 Refereed article in a scholarly journal
Copyright notice ©2013, The British Computer Society
Persistent URL http://hdl.handle.net/10536/DRO/DU:30116212

Connect to link resolver
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 0 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 254 Abstract Views, 2 File Downloads  -  Detailed Statistics
Created: Thu, 20 Dec 2018, 18:14:58 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.