Affinity-based hash tables

Abstract

From a trace of data accesses, it is possible to calculate an affinity hierarchy that groups related data together. Combining this hierarchy with the extremely common hash table, there is an opportunity to both improve cache performance and enable novel applications. This paper describes both the construction of the affinity hierarchy and its application to hash tables.