1007 search results - page 7 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
109
click to vote
NJC
2006
14 years 9 months ago
2006
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
VLDB
1989
ACM
15 years 1 months ago
1989
ACM
This paper presents a parallel algorithm for recursive query processing and shows how it can be efficiently implemented in a local computer network. The algorithm relies on an int...
CORR
2012
Springer
13 years 5 months ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
MDM
2004
Springer
15 years 2 months ago
2004
Springer
In this paper, we consider a data model for uncertain trajectories of moving objects. In our model, the trajectory is a vector of uniform stochastic processes. We study “univers...
147
click to vote
SIGMOD
2005
ACM
15 years 9 months ago
2005
ACM
The problem of estimating progress for long-running queries has recently been introduced. We analyze the characteristics of the progress estimation problem, from the perspective o...