In this paper we experimentally study the performance of main-memory, parallel, multi-core
join algorithms, focusing on sort-merge and (radix-) hash join. The relative performance of …

Intel has recently introduced Intel® Transactional Synchronization Extensions (Intel® TSX)
in the Intel 4th Generation Core™ Processors. With Intel TSX, a processor can dynamically …

Analytical database systems can achieve high throughput main-memory query execution by
being aware of the dynamics of highly-parallel modern hardware. Such systems rely on …

Modern database clusters entail two levels of networks: connecting CPUs and NUMA
regions inside a single server in the small and multiple servers in the large. The huge …

Sorting is at the core of many database operations, such as index creation, sort-merge joins,
and user-requested output sorting. As GPUs are emerging as a promising platform to …

Network communication is the slowest component of many operators in distributed parallel
databases deployed for large-scale analytics. Whereas considerable work has focused on …

Modern cosmology and plasma physics codes are now capable of simulating trillions of
particles on petascale systems. Each timestep output from such simulations is on the order …

This paper describes our new algorithm for sorting an array of structures by efficiently
exploiting the SIMD instructions and cache memory of today's processors. Recently …

In-place radix sort is a popular distribution-based sorting algorithm for short numeric or string
keys due to its linear run-time and constant memory complexity. However, efficient …

The growth in compute speed has outpaced the growth in network bandwidth over the last
decades. This has led to an increasing performance gap between local and distributed …