Autor:	Rahman Lavaee, Chen Ding, Brian Gernhardt
Rok vydání:	2014
Předmět:	Hash tree Hardware_MEMORYSTRUCTURES Theoretical computer science HAT-trie Hash list Computer science Hash function Hash chain Merkle tree Hash table Double hashing
Zdroj:	MSPC@PLDI
DOI:	10.1145/2618128.2618135
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::459ddf914276b4228908848357243d5d https://doi.org/10.1145/2618128.2618135 Zobrazit plný text záznamu