13 search results - page 2 / 3 » Fast Query Processing by Distributing an Index over CPU Cach... |
PODS
1998
ACM
13 years 9 months ago
1998
ACM
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
IDEAS
2008
IEEE
13 years 11 months ago
2008
IEEE
As the popularity of areas including document storage and distributed systems continues to grow, the demand for high performance XML databases is increasingly evident. This has le...
DPD
2006
13 years 4 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...
HPCA
2011
IEEE
12 years 8 months ago
2011
IEEE
Traditional architectural designs are normally focused on CPUs and have been often decoupled from I/O considerations. They are inefficient for high-speed network processing with a...