281 search results - page 17 / 57 » Querying the Guarded Fragment |
80
Voted
ICDT
2007
ACM
15 years 4 months ago
2007
ACM
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...
PODS
2005
ACM
15 years 10 months ago
2005
ACM
We study the satisfiability problem associated with XPath in the presence of DTDs. This is the problem of determining, given a query p in an XPath fragment and a DTD D, whether or...
89
Voted
VLDB
2002
ACM
14 years 9 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 ...
151
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
We present a collaborative, self-configuring high availability (HA) approach for stream processing that enables low-latency failure recovery while incurring small run-time overhea...
156
click to vote
SIGMOD
2007
ACM
15 years 10 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...