research-article

Union rewritings for XPath fragments

Authors:

Matthew Damigos,

Manolis GergatsoulisAuthors Info & Claims

IDEAS '11: Proceedings of the 15th Symposium on International Database Engineering & Applications

Pages 43 - 51

https://doi.org/10.1145/2076623.2076630

Published: 21 September 2011 Publication History

Abstract

In this paper, we study the problem of finding an equivalent rewriting of an XPath query using multiple views, and we show that the union operator may be required in order to find such a rewriting. In particular, focusing on the fragment of XPath containing both descendant edges and wildcard labels, we propose an algorithm that outputs a union of single-view rewritings (if there exists any) which equivalently rewrites a given query. For the same fragment of XPath, we give necessary and sufficient conditions for query containment and equivalence of unions of queries.

References

[1]

S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.

Digital Library

[2]

F. N. Afrati, R. Chirkova, M. Gergatsoulis, B. Kimelfeld, V. Pavlaki, and Y. Sagiv. On rewriting XPath queries using views. In EDBT, pages 168--179, 2009.

Digital Library

[3]

S. Amer-Yahia, S. Cho, L. V. S. Lakshmanan, and D. Srivastava. Minimization of tree pattern queries. In SIGMOD '01, pages 497--508. ACM, 2001.

Digital Library

[4]

A. Balmin, F. Özcan, K. S. Beyer, R. Cochrane, and H. Pirahesh. A framework for using materialized XPath views in XML query processing. In VLDB, pages 60--71, 2004.

Digital Library

[5]

D. Calvanese, G. D. Giacomo, M. Lenzerini, and M. Y. Vardi. Answering regular path queries using views. In ICDE, pages 389--398, 2000.

Digital Library

[6]

B. Cautis, A. Deutsch, and N. Onose. XPath rewriting using multiple views: Achieving completeness and efficiency. In WebDB, 2008.

[7]

B. Cautis, A. Deutsch, N. Onose, and V. Vassalos. Efficient rewriting of XPath queries using query set specifications. PVLDB, 2(1):301--312, 2009.

Digital Library

[8]

L. Chen and E. A. Rundensteiner. XCache: XQuery-based caching system. In WebDB, pages 31--36, 2002.

[9]

S. Cohen and Y. Y. Weiss. Bag equivalence of XPath queries. In ICDT, 2010.

Digital Library

[10]

B. Fazzinga, S. Flesca, and F. Furfaro. Xpath query relaxation through rewriting rules. IEEE Transactions on Knowledge and Data Engineering (TKDE), 23:1583--1600, 2011.

Digital Library

[11]

S. Flesca, F. Furfaro, and E. Masciari. On the minimization of xpath queries. J. ACM, 55:2:1--2:46, February 2008.

Digital Library

[12]

H. Garcia-Molina, J. D. Ullman, and J. Widom. Database Systems: The Complete Book. Prentice Hall Press, Upper Saddle River, NJ, USA, 2008.

Digital Library

[13]

G. Grahne and A. Thomo. Query containment and rewriting using views for regular path queries under constraints. In PODS, pages 111--122, 2003.

Digital Library

[14]

A. Y. Halevy. Answering queries using views: A survey. The VLDB Journal, 10(4):270--294, 2001.

Digital Library

[15]

L. V. S. Lakshmanan, H. Wang, and Z. J. Zhao. Answering tree pattern queries using views. In VLDB, pages 571--582, 2006.

Digital Library

[16]

B. Mandhani and D. Suciu. Query caching and view selection for xml databases. In VLDB, pages 469--480, 2005.

Digital Library

[17]

G. Miklau and D. Suciu. Containment and equivalence for a fragment of XPath. J. ACM, 51(1):2--45, 2004.

Digital Library

[18]

T. Milo and D. Suciu. Type inference for queries on semistructured data. In PODS '99, pages 215--226, New York, NY, USA, 1999. ACM.

Digital Library

[19]

Y. Papakonstantinou and V. Vassalos. Query rewriting for semistructured data. In SIGMOD Conference, pages 455--466, 1999.

Digital Library

[20]

N. Tang, J. X. Yu, M. T. Özsu, B. Choi, and K.-F. Wong. Multiple materialized view selection for XPath query rewriting. In ICDE, pages 873--882, 2008.

Digital Library

[21]

J. Wang and J. X. Yu. XPath rewriting using multiple views. In DEXA, pages 493--507, 2008.

Digital Library

[22]

J. Wang, J. X. Yu, and C. Liu. Independence of containing patterns property and its application in tree pattern query rewriting using views. World Wide Web, 12(1):87--105, 2009.

Digital Library

[23]

P. T. Wood. Minimising simple XPath expressions. In WebDB, pages 13--18, 2001.

[24]

W. Xu and Z. M. Özsoyoglu. Rewriting XPath queries using materialized views. In VLDB '05, pages 121--132, 2005.

Digital Library

[25]

L. H. Yang, M.-L. Lee, and W. Hsu. Efficient mining of XML query patterns for caching. In VLDB, pages 69--80, 2003.

Digital Library

[26]

M. Yannakakis. Algorithms for acyclic database schemes. In VLDB '81, pages 82--94, 1981.

Digital Library

[27]

R. Zhou, C. Liu, J. Wang, and J. Li. Containment between unions of XPath queries. In DASFAA '09, pages 405--420. Springer-Verlag, 2009.

Digital Library

Cited By

Afrati FChirkova R(2019)Answering Queries Using Views, Second EditionSynthesis Lectures on Data Management10.2200/S00884ED2V01Y201811DTM05414:3(1-275)Online publication date: 15-Apr-2019
https://doi.org/10.2200/S00884ED2V01Y201811DTM054
Wang JXu Yu J(2012)Revisiting answering tree pattern queries using viewsACM Transactions on Database Systems10.1145/2338626.233863137:3(1-34)Online publication date: 6-Sep-2012
https://dl.acm.org/doi/10.1145/2338626.2338631

Index Terms

Union rewritings for XPath fragments
1. Information systems
  1. Data management systems
    1. Database management system engines
      1. Database query processing
    2. Query languages
  2. Information systems applications
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Database query processing and optimization (theory)

Recommendations

Query rewritings using views for XPath queries, framework, and methodologies

Query rewriting using views is a technique that allows a query to be answered efficiently by using pre-computed materialized views. It has many applications, such as data caching, query optimization, schema integration, etc. This issue has been studied ...
Containment for XPath Fragments under DTD Constraints
ICDT '03: Proceedings of the 9th International Conference on Database Theory

The containment and equivalence problems for various fragments of XPath have been studied by a number of authors. For some fragments, deciding containment (and even minimisation) has been shown to be in PTIME, while for minor extensions containment has ...
Satisfiability of simple Xpath fragments under fixed DTDs
BNCOD'11: Proceedings of the 28th British national conference on Advances in databases

The XPath satisfiability problem is to decide, for an XPath expression q and a DTD D, if there exists an XML document t valid against D such that the answer of q on t is nonempty. It is shown that the satisfiability problem is intractable for many XPath ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

IDEAS '11: Proceedings of the 15th Symposium on International Database Engineering & Applications

September 2011

274 pages

ISBN:9781450306270

DOI:10.1145/2076623

General Chair:
Bipin C. Desai
Concordia University
,
Program Chairs:
Isabel Cruz
University of Illinois at Chicago
,
Jorge Bernardino
Instituto Politecnico de Coimbra

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 September 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Conference

IDEAS '11

IDEAS '11: 15th International Database Engineering & Applications Symposium

September 21 - 23, 2011

Lisboa, Portugal

Acceptance Rates

Overall Acceptance Rate 74 of 210 submissions, 35%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
87
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Afrati FChirkova R(2019)Answering Queries Using Views, Second EditionSynthesis Lectures on Data Management10.2200/S00884ED2V01Y201811DTM05414:3(1-275)Online publication date: 15-Apr-2019
https://doi.org/10.2200/S00884ED2V01Y201811DTM054
Wang JXu Yu J(2012)Revisiting answering tree pattern queries using viewsACM Transactions on Database Systems10.1145/2338626.233863137:3(1-34)Online publication date: 6-Sep-2012
https://dl.acm.org/doi/10.1145/2338626.2338631

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten