Evaluating contained rewritings for XPath queries on materialized views

R. Zhou, C. Liu, Jianxin Li, J. Wang, J. Liu

Research output: Chapter in Book/Conference paperConference paper

1 Citation (Scopus)

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. © 2011 Springer-Verlag.
Original languageEnglish
Title of host publicationDatabase Systems for Advanced Applications
Subtitle of host publicationDASFAA 2011
EditorsJeffrey Xu Yu, Myoung Ho Kim, Rainer Unland
Place of PublicationHong Kong, China
PublisherSpringer
Pages481-495
Number of pages15
Volume6587 LNCS
EditionPart 1
ISBN (Print)9783642201486
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event16th International Conference on Database Systems for Advanced Applications, DASFAA 2011 - Hong Kong, China
Duration: 22 Apr 201125 Apr 2011

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume6587
ISSN (Print)0302-9743

Conference

Conference16th International Conference on Database Systems for Advanced Applications, DASFAA 2011
CountryChina
CityHong Kong
Period22/04/1125/04/11

Fingerprint Dive into the research topics of 'Evaluating contained rewritings for XPath queries on materialized views'. Together they form a unique fingerprint.

Cite this