2609 search results - page 216 / 522 » Optimizing for parallelism and data locality |
172
click to vote
ISHPC
2000
Springer
15 years 9 months ago
2000
Springer
This paper describes transparent mechanisms for emulating some of the data distribution facilities offered by traditional data-parallel programming models, such as High Performance...
197
Voted
EDBT
2000
ACM
15 years 10 months ago
2000
ACM
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
148
click to vote
BTW
2005
Springer
15 years 11 months ago
2005
Springer
: Optimizers in modern DBMSs utilize a cost model to choose an efficient query execution plan (QEP) among all possible ones for a given query. The accuracy of the cost estimates de...
146
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We consider distillation of secret bits from partially secret noisy correlations PABE, shared between two honest parties and an eavesdropper. The most studied distillation scenario...
173
click to vote
PC
2002
15 years 5 months ago
2002
The I/O access patterns of many parallel applications consist of accesses to a large number of small, noncontiguous pieces of data. If an application's I/O needs are met by m...