14 search results - page 1 / 3 » (Almost) Optimal Parallel Block Access for Range Queries |
PODS
2000
ACM
13 years 9 months ago
2000
ACM
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
EDBT
2004
ACM
14 years 5 months ago
2004
ACM
Due to the large difference between seek time and transfer time in current disk technology, it is advantageous to perform large I/O using a single sequential access rather than mu...
DPD
2006
13 years 5 months ago
2006
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
CCGRID
2005
IEEE
13 years 10 months ago
2005
IEEE
Partial replication is one type of optimization to speed up execution of queries submitted to large datasets. In partial replication, a portion of the dataset is extracted, re-org...