Sciweavers

37 search results - page 2 / 8
» Containment and Equivalence for an XPath Fragment
Sort
View
PODS
2007
ACM
102views Database» more  PODS 2007»
14 years 5 months ago
The complexity of query containment in expressive fragments of XPath 2.0
Query containment has been studied extensively for fragments of
Balder ten Cate, Carsten Lutz
ICDT
2007
ACM
114views Database» more  ICDT 2007»
13 years 11 months ago
Axiomatizing the Logical Core of XPath 2.0
The first aim of this paper is to present the logical core of XPath 2.0: a logically clean, decidable fragment, which includes most navigational features of XPath 2.0 (complex co...
Balder ten Cate, Maarten Marx
ICDT
2003
ACM
125views Database» more  ICDT 2003»
13 years 10 months ago
XPath Containment in the Presence of Disjunction, DTDs, and Variables
XPath is a simple language for navigating an XML tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various fragm...
Frank Neven, Thomas Schwentick
VLDB
2005
ACM
125views Database» more  VLDB 2005»
13 years 10 months ago
Rewriting XPath Queries Using Materialized Views
As a simple XML query language but with enough expressive power, XPath has become very popular. To expedite evaluation of XPath queries, we consider the problem of rewriting XPath...
Wanhong Xu, Z. Meral Özsoyoglu