6004 search results - page 563 / 1201 » Parallelizing query optimization |
220
click to vote
DEBS
2011
ACM
14 years 10 months ago
2011
ACM
Many data-driven social and Web applications involve collaboration and coordination. The vision of declarative data-driven coordination (D3C), proposed in [9], is to support coord...
172
click to vote
VECPAR
2004
Springer
15 years 12 months ago
2004
Springer
In this work we investigate how the compiler technique of message strip mining performs in practice on contemporary high performance networks. Message strip mining attempts to redu...
209
click to vote
HPCC
2011
Springer
14 years 6 months ago
2011
Springer
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
283
click to vote
ICDE
2005
IEEE
16 years 8 months ago
2005
IEEE
Given a region qR and a future timestamp qT, a "range aggregate" query estimates the number of objects expected to appear in qR at time qT. Currently the only methods fo...
282
click to vote
ICDE
2000
IEEE
16 years 7 months ago
2000
IEEE
Optimizing queries that involve operations on spatial data requires estimating the selectivity and cost of these operations. In this paper, we focus on estimating the cost of spat...