347 search results - page 29 / 70 » Certain answers for XML queries |
ICDE
2008
IEEE
14 years 10 months ago
2008
IEEE
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
CIA
1998
Springer
14 years 27 days ago
1998
Springer
In a simple cooperative MAS model where a collection of "querying agents" can send queries to a collection of "information agents", we formalize the problem of ...
FUIN
2008
13 years 8 months ago
2008
In this paper, we introduce preferential regular path queries. These are regular path queries whose symbols are annotated with preference weights for "scaling" up or down...
PODS
2004
ACM
14 years 8 months ago
2004
ACM
The important challenge of evaluating XPath queries over XML streams has sparked much interest in the past few years. A number of algorithms have been proposed, supporting wider f...
ICDT
2003
ACM
14 years 1 months ago
2003
ACM
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...