Query answering using views for XML
The problem of answering query using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing the database. As XML becomes the standard of data representation and exchange over the internet, the problem has recen...
Main Author: | |
---|---|
Language: | English |
Published: |
2009
|
Online Access: | http://hdl.handle.net/2429/16451 |
id |
ndltd-UBC-oai-circle.library.ubc.ca-2429-16451 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-UBC-oai-circle.library.ubc.ca-2429-164512018-01-05T17:38:22Z Query answering using views for XML Zhao, Zheng The problem of answering query using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing the database. As XML becomes the standard of data representation and exchange over the internet, the problem has recently drawn more attentions because of its relevance to a wide varieties of XML data management problems, there is a pressing needs to develop more techniques to solve it for XML data effectively and efficiently. We study a class of XPath queries and materialized views which may contain child, descendant axis and predicates. We first describe an algorithm to find the maximally-contained rewritings in the absence of database schema. We then present an efficient algorithm to search the maximally-contained rewriting under choice-free acyclic schema and prove the uniqueness of the maximally-contained rewriting. Finally we show its performance experimentally by extending our algorithm to answer queries in XQuery expression. Science, Faculty of Computer Science, Department of Graduate 2009-12-11T17:11:36Z 2009-12-11T17:11:36Z 2005 2005-11 Text Thesis/Dissertation http://hdl.handle.net/2429/16451 eng For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use. |
collection |
NDLTD |
language |
English |
sources |
NDLTD |
description |
The problem of answering query using views is to find efficient methods of answering
a query using a set of previously materialized views over the database, rather than
accessing the database. As XML becomes the standard of data representation and
exchange over the internet, the problem has recently drawn more attentions because
of its relevance to a wide varieties of XML data management problems, there is a
pressing needs to develop more techniques to solve it for XML data effectively and
efficiently.
We study a class of XPath queries and materialized views which may contain
child, descendant axis and predicates. We first describe an algorithm to find the
maximally-contained rewritings in the absence of database schema. We then present
an efficient algorithm to search the maximally-contained rewriting under choice-free
acyclic schema and prove the uniqueness of the maximally-contained rewriting. Finally
we show its performance experimentally by extending our algorithm to answer
queries in XQuery expression. === Science, Faculty of === Computer Science, Department of === Graduate |
author |
Zhao, Zheng |
spellingShingle |
Zhao, Zheng Query answering using views for XML |
author_facet |
Zhao, Zheng |
author_sort |
Zhao, Zheng |
title |
Query answering using views for XML |
title_short |
Query answering using views for XML |
title_full |
Query answering using views for XML |
title_fullStr |
Query answering using views for XML |
title_full_unstemmed |
Query answering using views for XML |
title_sort |
query answering using views for xml |
publishDate |
2009 |
url |
http://hdl.handle.net/2429/16451 |
work_keys_str_mv |
AT zhaozheng queryansweringusingviewsforxml |
_version_ |
1718590222567997440 |