Cache-aware Hashing
Cache-Aware Hashing is a hash table organization method that optimizes data placement and access patterns by explicitly taking into account the hierarchical structure and performance characteristics of the underlying memory cache to minimize cache misses and improve retrieval efficiency.
11
Publications
878
Citations
33
Authors
15
Institutions
Publications per year
2017–2026
2
Parents
11
Main-memory hash joins on multi-core CPUs: Tuning to the underlying hardware
Çagri Balkesen, Jens Teubner, Gustavo Alonso et al. · 2013 · 271 citations
Improving hash join performance through prefetching
Shimin Chen, Anastassia Ailamaki, Phillip B. Gibbons et al. · ACM Transactions on Database Systems · 2007 · 133 citations · Full text
Improving hash join performance through prefetching
S. Chen, Anastassia Ailamaki, Phillip B. Gibbons et al. · 2004 · 89 citations · Full text
1–5 of 11
33
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 33
15
Intel (United States)
Santa Clara, United States
2 h-index
4 publications
488 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
5 publications
533 citations
Cisco Systems (United States)
San Jose, United States
2 h-index
4 publications
291 citations
Intel (India)
Bengaluru, India
1 h-index
1 publications
21 citations
ETH Zurich
Zurich, Switzerland
1 h-index
3 publications
813 citations

Barcelona Supercomputing Center
Barcelona, Spain
1 h-index
2 publications
40 citations
UCLouvain
Louvain-la-Neuve, Belgium
1 h-index
2 publications
42 citations

University of Waterloo
Waterloo, Canada
1 h-index
1 publications
271 citations
1–8 of 15
Conference · 1 publications · 42 citations
1
h-index
TODS · 1 publications · 133 citations
1
h-index
Repository · 1 publications · 11 citations
1
h-index
PVLDB · 1 publications · 134 citations
1
h-index
Conference · 1 publications · 83 citations
1
h-index
1–5