Sciweavers

103 search results - page 1 / 21
» Improving Index Performance through Prefetching
Sort
View
SIGMOD
2001
ACM
108views Database» more  SIGMOD 2001»
14 years 4 months ago
Improving Index Performance through Prefetching
This paper proposes and evaluates Prefetching B+ -Trees pB+ -Trees, which use prefetching to accelerate two important operations on B+ -Tree indices: searches and range scans. To ...
Shimin Chen, Phillip B. Gibbons, Todd C. Mowry
SC
1995
ACM
13 years 7 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
ICPP
2003
IEEE
13 years 9 months ago
Enabling Partial Cache Line Prefetching Through Data Compression
Hardware prefetching is a simple and effective technique for hiding cache miss latency and thus improving the overall performance. However, it comes with addition of prefetch buff...
Youtao Zhang, Rajiv Gupta
ICDE
2004
IEEE
88views Database» more  ICDE 2004»
14 years 5 months ago
Improving Hash Join Performance through Prefetching
Shimin Chen, Anastassia Ailamaki, Phillip B. Gibbo...
ICDCS
2007
IEEE
13 years 10 months ago
STEP: Sequentiality and Thrashing Detection Based Prefetching to Improve Performance of Networked Storage Servers
State-of-the-art networked storage servers are equipped with increasingly powerful computing capability and large DRAM memory as storage caches. However, their contribution to the...
Shuang Liang, Song Jiang, Xiaodong Zhang