Evaluating Contained Rewritings for XPath Queries on Materialized Views

No Thumbnail Available
File version
Author(s)
Zhou, Rui
Liu, Chengfei
Li, Jianxin
Wang, Junhu
Liu, Jixue
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)

Yu, JX

Kim, MH

Unland, R

Date
2011
Size
File type(s)
Location
License
Abstract

In 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.

Journal Title

Lecture Notes In Computer Science

Conference Title
Book Title
Edition
Volume

6587

Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject

Database systems

Persistent link to this record
Citation
Collections