Indexes are models: a\btree-Index can be seen as a model to map a key to the position of a
record within a sorted array, a Hash-Index as a model to map a key to a position of a record …

Recent advancements in learned index structures propose replacing existing index
structures, like B-Trees, with approximate learned models. In this work, we present a unified …

In-memory database management systems (DBMSs) are a key component of modern on-
line analytic processing (OLAP) applications, since they provide low-latency access to large …

Relational equi-joins are at the heart of almost every query plan. They have been studied,
improved, and reexamined on a regular basis since the existence of the database …

An efficient implementation of a hash join has been a highly researched problem for
decades. Recently, the radix join has been shown to have superior performance over the …

The SCIP Optimization Suite is a powerful collection of optimization software that consists of
the branch-cut-and-price framework and mixed-integer programming solver SCIP, the linear …

Modern dual in-line memory modules (DIMMs) support processing-in-memory (PIM) by
implementing in-DIMM processors (IDPs) located near memory banks. PIM can greatly …

With the emerging big data applications of Machine Learning, Speech Recognition, Artificial
Intelligence, and DNA Sequencing in recent years, computer architecture research …

Data partitioning is an important primitive for in-memory data processing systems, and in
many cases it is the key performance bottleneck. This important primitive has been the focus …

Data processing systems often leverage vector instructions to achieve higher performance.
When applying vector instructions, an often overlooked data structure is the hash table, even …