Sciweavers

91 search results - page 4 / 19
» Improving Hash Join Performance through Prefetching
Sort
View
SC
1995
ACM
13 years 11 months ago
Index Array Flattening Through Program Transformation
This paper presents techniques for compiling loops with complex, indirect array accesses into loops whose array references have at most one level of indirection. The transformatio...
Raja Das, Paul Havlak, Joel H. Saltz, Ken Kennedy
DPD
2006
98views more  DPD 2006»
13 years 7 months ago
GRACE-based joins on active storage devices
Contemporary long-term storage devices feature powerful embedded processors and sizeable memory buffers. Active Storage Devices (ASD) is the hard disk technology that makes use of ...
Vassilis Stoumpos, Alex Delis
IJSN
2007
106views more  IJSN 2007»
13 years 7 months ago
Hash-AV: fast virus signature scanning by cache-resident filters
Abstract— Fast virus scanning is becoming increasingly important in today’s Internet. While Moore’s law continues to double CPU cycle speed, virus scanning applications fail ...
Ozgun Erdogan, Pei Cao
CEE
2008
119views more  CEE 2008»
13 years 7 months ago
A clustering-based prefetching scheme on a Web cache environment
Web prefetching is an attractive solution to reduce the network resources consumed by Web services as well as the access latencies perceived by Web users. Unlike Web caching, whic...
George Pallis, Athena Vakali, Jaroslav Pokorn&yacu...
NETWORKING
2004
13 years 8 months ago
Scalable Packet Classification through Maximum Entropy Hashing
In this paper we propose a new packet classification algorithm, which can substantially improve the performance of a classifier by decreasing the rulebase lookup latency. The algor...
Lynn Choi, Jaesung Heo, Hyogon Kim, Jinoo Joung, S...