591 search results - page 1 / 119 » The complexity of XPath query evaluation |
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
The XPath language incorporates powerful primitives for formulating queries containing nested subexpressions which are existentially or universally quantified. However, even the b...
PODS
2003
ACM
14 years 5 months ago
2003
ACM
VLDB
2002
ACM
13 years 4 months ago
2002
ACM
Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in ...
ICEIS
2006
IEEE
13 years 11 months ago
2006
IEEE
The satisfiability test checks, whether or not the evaluation of a query returns the empty set for any input document, and can be used in query optimization for avoiding the submis...
SIGMOD
2007
ACM
14 years 5 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...