Multiple materialized view selection for XPath query rewriting

Nan Tang, Jeffrey Xu Yu, M. Tamer Özsu, Byron Choi, Kam Fai Wong

Research output: Chapter in Book/Report/Conference proceedingConference contribution

35 Citations (Scopus)

Abstract

We study the problem of answering XPATH queries using multiple materialized views. Despite the efforts on answering queries using single materialized view, answering queries using multiple views remains relatively new. We address two important aspects of this problem: multiple-view selection and equivalent multiple-view rewriting. With regards to the first problem, we propose an NFA-based approach (called VFILTER) to filter views that cannot be used to answer a given query. We then present the criterion for multiple view/query answerability. Based on the output of VRLTER, we further propose a heuristic method to identify a minimal view set that can answer a given query. For the problem of multiple-view rewriting, we first refine the materialized fragments of each selected view (like pushing selection), we then join the refined fragments utilizing an encoding scheme. Finally, we extract the result of the query from the materialized fragments of a single view. Experiments show the efficiency of our approach.

Original languageEnglish
Title of host publicationProceedings - International Conference on Data Engineering
Pages873-882
Number of pages10
DOIs
Publication statusPublished - 1 Oct 2008
Externally publishedYes
Event2008 IEEE 24th International Conference on Data Engineering, ICDE'08 - Cancun, Mexico
Duration: 7 Apr 200812 Apr 2008

Other

Other2008 IEEE 24th International Conference on Data Engineering, ICDE'08
CountryMexico
CityCancun
Period7/4/0812/4/08

Fingerprint

Heuristic methods
Experiments

ASJC Scopus subject areas

  • Information Systems
  • Signal Processing
  • Software

Cite this

Tang, N., Yu, J. X., Özsu, M. T., Choi, B., & Wong, K. F. (2008). Multiple materialized view selection for XPath query rewriting. In Proceedings - International Conference on Data Engineering (pp. 873-882). [4497496] https://doi.org/10.1109/ICDE.2008.4497496

Multiple materialized view selection for XPath query rewriting. / Tang, Nan; Yu, Jeffrey Xu; Özsu, M. Tamer; Choi, Byron; Wong, Kam Fai.

Proceedings - International Conference on Data Engineering. 2008. p. 873-882 4497496.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tang, N, Yu, JX, Özsu, MT, Choi, B & Wong, KF 2008, Multiple materialized view selection for XPath query rewriting. in Proceedings - International Conference on Data Engineering., 4497496, pp. 873-882, 2008 IEEE 24th International Conference on Data Engineering, ICDE'08, Cancun, Mexico, 7/4/08. https://doi.org/10.1109/ICDE.2008.4497496
Tang N, Yu JX, Özsu MT, Choi B, Wong KF. Multiple materialized view selection for XPath query rewriting. In Proceedings - International Conference on Data Engineering. 2008. p. 873-882. 4497496 https://doi.org/10.1109/ICDE.2008.4497496
Tang, Nan ; Yu, Jeffrey Xu ; Özsu, M. Tamer ; Choi, Byron ; Wong, Kam Fai. / Multiple materialized view selection for XPath query rewriting. Proceedings - International Conference on Data Engineering. 2008. pp. 873-882
@inproceedings{63a7155717354fa991b448c1e92a1452,
title = "Multiple materialized view selection for XPath query rewriting",
abstract = "We study the problem of answering XPATH queries using multiple materialized views. Despite the efforts on answering queries using single materialized view, answering queries using multiple views remains relatively new. We address two important aspects of this problem: multiple-view selection and equivalent multiple-view rewriting. With regards to the first problem, we propose an NFA-based approach (called VFILTER) to filter views that cannot be used to answer a given query. We then present the criterion for multiple view/query answerability. Based on the output of VRLTER, we further propose a heuristic method to identify a minimal view set that can answer a given query. For the problem of multiple-view rewriting, we first refine the materialized fragments of each selected view (like pushing selection), we then join the refined fragments utilizing an encoding scheme. Finally, we extract the result of the query from the materialized fragments of a single view. Experiments show the efficiency of our approach.",
author = "Nan Tang and Yu, {Jeffrey Xu} and {\"O}zsu, {M. Tamer} and Byron Choi and Wong, {Kam Fai}",
year = "2008",
month = "10",
day = "1",
doi = "10.1109/ICDE.2008.4497496",
language = "English",
isbn = "9781424418374",
pages = "873--882",
booktitle = "Proceedings - International Conference on Data Engineering",

}

TY - GEN

T1 - Multiple materialized view selection for XPath query rewriting

AU - Tang, Nan

AU - Yu, Jeffrey Xu

AU - Özsu, M. Tamer

AU - Choi, Byron

AU - Wong, Kam Fai

PY - 2008/10/1

Y1 - 2008/10/1

N2 - We study the problem of answering XPATH queries using multiple materialized views. Despite the efforts on answering queries using single materialized view, answering queries using multiple views remains relatively new. We address two important aspects of this problem: multiple-view selection and equivalent multiple-view rewriting. With regards to the first problem, we propose an NFA-based approach (called VFILTER) to filter views that cannot be used to answer a given query. We then present the criterion for multiple view/query answerability. Based on the output of VRLTER, we further propose a heuristic method to identify a minimal view set that can answer a given query. For the problem of multiple-view rewriting, we first refine the materialized fragments of each selected view (like pushing selection), we then join the refined fragments utilizing an encoding scheme. Finally, we extract the result of the query from the materialized fragments of a single view. Experiments show the efficiency of our approach.

AB - We study the problem of answering XPATH queries using multiple materialized views. Despite the efforts on answering queries using single materialized view, answering queries using multiple views remains relatively new. We address two important aspects of this problem: multiple-view selection and equivalent multiple-view rewriting. With regards to the first problem, we propose an NFA-based approach (called VFILTER) to filter views that cannot be used to answer a given query. We then present the criterion for multiple view/query answerability. Based on the output of VRLTER, we further propose a heuristic method to identify a minimal view set that can answer a given query. For the problem of multiple-view rewriting, we first refine the materialized fragments of each selected view (like pushing selection), we then join the refined fragments utilizing an encoding scheme. Finally, we extract the result of the query from the materialized fragments of a single view. Experiments show the efficiency of our approach.

UR - http://www.scopus.com/inward/record.url?scp=52649168262&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=52649168262&partnerID=8YFLogxK

U2 - 10.1109/ICDE.2008.4497496

DO - 10.1109/ICDE.2008.4497496

M3 - Conference contribution

AN - SCOPUS:52649168262

SN - 9781424418374

SP - 873

EP - 882

BT - Proceedings - International Conference on Data Engineering

ER -