Cache-oblivious Hashing

Rasmus Pagh; Zhewei Wei; Ke Yi; Qin Zhang

Cache-oblivious Hashing

Rasmus Pagh, Zhewei Wei, Ke Yi, Qin Zhang

Algorithms

Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

Abstract

In this paper we study if it is possible to build a cache-oblivious hash table that works well with any
blocking. Such a hash table will automatically perform well across all levels of the memory hierarchy
and does not need any hardware-specific tuning, an important feature in autonomous databases.

Originalsprog	Engelsk
Tidsskrift	Algorithmica
Vol/bind	69
Udgave nummer	4
ISSN	0178-4617
Status	Udgivet - aug. 2014

Emneord

Cache-oblivious algorithms
Hashing

Citationsformater

@article{8a4686f441924ee6b7a02f56599d15b2,

title = "Cache-oblivious Hashing",

abstract = "In this paper we study if it is possible to build a cache-oblivious hash table that works well with anyblocking. Such a hash table will automatically perform well across all levels of the memory hierarchyand does not need any hardware-specific tuning, an important feature in autonomous databases.",

keywords = "Cache-oblivious algorithms, Hashing, Cache-oblivious algorithms, Hashing",

author = "Rasmus Pagh and Zhewei Wei and Ke Yi and Qin Zhang",

note = "EPub ahead of print iflg. SpringerLink 21.11.13 haal. Tilbage til Created.",

year = "2014",

month = aug,

language = "English",

volume = "69",

journal = "Algorithmica",

issn = "0178-4617",

publisher = "Springer New York LLC",

number = "4",

}

TY - JOUR

T1 - Cache-oblivious Hashing

AU - Pagh, Rasmus

AU - Wei, Zhewei

AU - Yi, Ke

AU - Zhang, Qin

N1 - EPub ahead of print iflg. SpringerLink 21.11.13 haal. Tilbage til Created.

PY - 2014/8

Y1 - 2014/8

N2 - In this paper we study if it is possible to build a cache-oblivious hash table that works well with anyblocking. Such a hash table will automatically perform well across all levels of the memory hierarchyand does not need any hardware-specific tuning, an important feature in autonomous databases.

AB - In this paper we study if it is possible to build a cache-oblivious hash table that works well with anyblocking. Such a hash table will automatically perform well across all levels of the memory hierarchyand does not need any hardware-specific tuning, an important feature in autonomous databases.

KW - Cache-oblivious algorithms

KW - Hashing

KW - Cache-oblivious algorithms

KW - Hashing

M3 - Journal article

SN - 0178-4617

VL - 69

JO - Algorithmica

JF - Algorithmica

IS - 4

ER -

Cache-oblivious Hashing

Abstract

Emneord

Fingeraftryk

Citationsformater