On Equivalence and Rewriting of XPath Queries Using Views under DTD Constraints

  • Pantelis Aravogliadis
  • Vasilis Vassalos
Conference paper

DOI: 10.1007/978-3-642-23091-2_1

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6861)
Cite this paper as:
Aravogliadis P., Vassalos V. (2011) On Equivalence and Rewriting of XPath Queries Using Views under DTD Constraints. In: Hameurlain A., Liddle S.W., Schewe KD., Zhou X. (eds) Database and Expert Systems Applications. DEXA 2011. Lecture Notes in Computer Science, vol 6861. Springer, Berlin, Heidelberg

Abstract

It has long been recognized that query rewriting techniques are important tools for query optimization and semantic caching and are at the heart of data integration systems. In particular, the problem of rewriting queries using view definitions has received a lot of attention in these contexts. At the same time, the XPath language has become very popular for processing XML data, and there is much recent progress in semantic XPath optimization problems, such as XPath containment, and, more recently, XPath rewriting using views. In this paper we address the open problems of finding equivalent query rewritings using views for XPath queries and views that include the child, predicate and wildcard features (i.e., they are in XP(/, [], *)) under DTD constraints. In the process, we also develop novel containment tests for queries in XP(/,[],*) under DTD constraints.

Keywords

XML data XPath processing query rewriting using views 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Pantelis Aravogliadis
    • 1
  • Vasilis Vassalos
    • 1
  1. 1.Department of InformaticsAthens University of Economics and BusinessAthensGreece

Personalised recommendations