Cache-oblivious hashing

The hash table, especially its external memory version, is one of the most important index structures in large databases. Assuming a truly random hash function, it is known that in a standard external hash table with block size b, searching for a particular key only takes expected average tq = 1+1/2Ω(b)

• Type: Conference
• Year: 2010
• Where: PODS
• Authors: Rasmus Pagh, Zhewei Wei, Ke Yi, Qin Zhang
• Keywords: Database, External Hash Table, Hash Table, PODS 2010, Random Hash Function