1007 search results - page 49 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
193
Voted
GIS
2006
ACM
16 years 3 months ago
2006
ACM
This paper presents a query optimizer module based on cost estimation that chooses the best filtering step algorithm to perform a specific spatial join operation. A set of express...
165
Voted
ICDE
2011
IEEE
14 years 6 months ago
2011
IEEE
— Array database systems are architected for scientific and engineering applications. In these applications, the value of a cell is often imprecise and uncertain. There are at le...
216
Voted
ICDE
2006
IEEE
16 years 3 months ago
2006
IEEE
In this paper, we propose DBSampler, a query execution mechanism to answer "partial selection" queries in peerto-peer databases. A partial selection query is an arbitrar...
133
Voted
IPPS
2010
IEEE
15 years 9 days ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
106
click to vote
SIAMJO
2008
15 years 2 months ago
2008
This paper describes a Parallel Space Decomposition (PSD) technique for the Mesh Adaptive Direct Search (MADS) algorithm. MADS extends Generalized Pattern Search for constrained n...