Hashing is a fundamental operation in database management, playing a key role in the
implementation of numerous core database data structures and algorithms. Traditional hash …

The linear-probing hash table is one of the oldest and most widely used data structures in
computer science. However, linear probing famously comes with a major draw-back: as …

Despite being one of the oldest data structures in computer science, hash tables continue to
be the focus of a great deal of both theoretical and empirical research. A central reason for …

We introduce a classical open-addressed hash table, called rainbow hashing, that supports
a load factor of up to 1 -ε, while also supporting O(1) expected-time queries, and …

This paper presents DLHT, a concurrent in-memory hashtable. Despite efforts to optimize
hashtables, that go as far as sacrificing core functionality, state-of-the-art designs still incur …

Hashing is a common technique used in data processing, with a strong impact on the time
and resources spent on computation. Hashing also affects the applicability of theoretical …

Linear-probing hash tables have been classically believed to support insertions in time
Θ(x^2), where 1-1/x is the load factor of the hash table. Recent work by Bender, Kuszmaul …

Since 1968, one of the simplest open questions in the theory of hash tables has been to
prove anything nontrivial about the correctness of quadratic probing. We make the first …

To scale applications on multicores up to bigger problems, software systems must be
optimized both for parallelism to take full advantage of the multiple cores and for locality to …

Virtual address translation is increasingly becoming a bottleneck for big data applications. In
modern systems, virtual memory abstracts each application's memory space, offering …