Cache-oblivious Hashing
- Rasmus Pagh,
- Zhewei Wei,
- Ke Yi,
- Qin Zhang
- ,
- Aarhus University,
- The Hong Kong University of Science and Technology,
- University of Copenhagen
Research Output:
Journal Article or Conference Article in Journal
Journal article
Peer-reviewPublication Information
Output type
Research Output:
Journal Article or Conference Article in Journal
Journal article
Peer-reviewOriginal language
EnglishJournal (Volume, Issue Number)
Algorithmica (Volume 69, Issue 4)Publication milestones
- Published - 08/2014
Publication status
Published - 08/2014
ISSN
0178-4617Abstract
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.
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.