While FPGAs have seen prior use in database systems, in recent years interest in using
FPGA to accelerate databases has declined in both industry and academia for the following …

With modern computer architecture evolving, two problems conspire against the state-of-the-
art approaches in parallel query execution:(i) to take advantage of many-cores, all query …

There has been significant amount of excitement and recent work on GPU-based database
systems. Previous work has claimed that these systems can perform orders of magnitude …

Database systems running on a cluster of machines, ie rack-scale databases, are a common
architecture for many large databases and data appliances. As the data movement across …

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 …

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 …

This article provides an overview of recent developments in mainmemory database systems.
With growing memory sizes and memory prices dropping by a factor of 10 every 5 years …

We present new hash tables for joins, and a hash join based on them, that consumes far
less memory and is usually faster than recently published in-memory joins. Our hash join is …

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 …

Implementing parallel operators in multi-core machines often involves a data partitioning
step that divides the data into cache-size blocks and arranges them so to allow concurrent …