XPath Rewriting Using Multiple Views

Loading...
Thumbnail Image
File version
Author(s)
Wang, Junhu
Yu, Jeffrey Xu
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)

Bhowmick, SS

Kung, J

Wagner, R

Date
2008
Size

258969 bytes

File type(s)

application/pdf

Location
License
Abstract

We study the problem of tree pattern query rewriting using multiple views for the class of tree patterns in P{//,[]}. Previous work has considered the rewriting problem using a single view. We consider two different ways of combining multiple views, define rewritings of a tree pattern using these combinations, and study the relationship between them. We show that when rewritings using single views do not exist, we may use such combinations of multiple views to rewrite a query, and even if rewritings using single views do exist, the rewritings using combinations of multiple views may provide more answers than those provided by the union of the rewritings using the individual views. We also study properties of intersections of tree patterns, and present algorithms for finding rewritings using intersections of views.

Journal Title

Lecture Notes in Computer science

Conference Title
Book Title
Edition
Volume

5181

Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement

© 2008 Springer Berlin / Heidelberg. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. The original publication is available at www.springerlink.com

Item Access Status
Note
Access the data
Related item(s)
Subject

Database systems

Persistent link to this record
Citation
Collections