File(s) under permanent embargo
Evaluating contained rewritings for XPath queries on materialized views
conference contribution
posted on 2011-01-01, 00:00 authored by Rui Zhou, Chengfei Liu, Jianxin LiJianxin Li, Junhu Wang, Jixue LiuIn this paper, we study the problem how to efficiently evaluate a set of contained rewritings on materialized views. Previous works focused on how to find a set of contained rewritings given a view and a query, but did not address how to evaluate the rewritings on materialized views. To evaluate a potential exponential number of contained rewritings, we design two algorithms, a basic algorithm and an optimized algorithm. Both algorithms are built on the observation that the exponential number of contained rewritings are actually composed by a linear number of component patterns. In the optimized algorithm, we further design four important pruning rules and several heuristic rules that can effectively reduce the number of component patterns we need to evaluate. The experiments demonstrate the efficiency of our algorithms.
History
Event
Database Systems for Advanced Applications. Conference (16th : 2011 : Hong Kong, China)Series
Database Systems for Advanced Applications ConferencePagination
481 - 495Publisher
SpringerLocation
Hong Kong, ChinaPlace of publication
Berlin, GermanyPublisher DOI
Start date
2011-04-22End date
2011-04-25ISBN-13
978-3-642-20148-6Language
engPublication classification
E1.1 Full written paper - refereedCopyright notice
2011, Springer-Verlag Berlin HeidelbergEditor/Contributor(s)
J Xu Yu, M Ho Kim, R UnlandTitle of proceedings
DASFAA 2011 : Proceedings of the 16th International Conference on Database Systems for Advanced Applications 2011Usage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC