Sciweavers

21 search results - page 1 / 5
» The complexity of query containment in expressive fragments ...
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
JAPLL
2010
104views more  JAPLL 2010»
13 years 3 months ago
Complete axiomatizations for XPath fragments
We provide complete axiomatizations for several fragments of XPath: sets of equivalences from which every other valid equivalence is derivable. Specifically, we axiomatize downwar...
Balder ten Cate, Tadeusz Litak, Maarten Marx
CORR
2006
Springer
122views Education» more  CORR 2006»
13 years 5 months ago
On the complexity of 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 frag...
Frank Neven, Thomas Schwentick
DOCENG
2006
ACM
13 years 11 months ago
Comparing XML path expressions
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
Pierre Genevès, Nabil Layaïda
DKE
2007
136views more  DKE 2007»
13 years 4 months ago
Deciding XPath containment with MSO
XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath f...
Pierre Genevès, Nabil Layaïda