In-memory database acceleration on FPGAs: a survey

J Fang, YTB Mulder, J Hidders, J Lee, HP Hofstee - The VLDB Journal, 2020 - Springer
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 …

Sensitive protein alignments at tree-of-life scale using DIAMOND

B Buchfink, K Reuter, HG Drost - Nature methods, 2021 - nature.com
We are at the beginning of a genomic revolution in which all known species are planned to
be sequenced. Accessing such data for comparative analyses is crucial in this new age of …

Morsel-driven parallelism: a NUMA-aware query evaluation framework for the many-core age

V Leis, P Boncz, A Kemper, T Neumann - Proceedings of the 2014 ACM …, 2014 - dl.acm.org
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 …

Main-memory hash joins on multi-core CPUs: Tuning to the underlying hardware

C Balkesen, J Teubner, G Alonso… - 2013 IEEE 29th …, 2013 - ieeexplore.ieee.org
The architectural changes introduced with multi-core CPUs have triggered a redesign of
main-memory join algorithms. In the last few years, two diverging views have appeared. One …

Rethinking SIMD vectorization for in-memory databases

O Polychroniou, A Raghavan, KA Ross - Proceedings of the 2015 ACM …, 2015 - dl.acm.org
Analytical databases are continuously adapting to the underlying hardware in order to
saturate all sources of parallelism. At the same time, hardware evolves in multiple directions …

Multi-core, main-memory joins: sort vs. hash revisited

C Balkesen, G Alonso, J Teubner… - Proceedings of the VLDB …, 2013 - dl.acm.org
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 …

Skew strikes back: new developments in the theory of join algorithms

HQ Ngo, C Ré, A Rudra - Acm Sigmod Record, 2014 - dl.acm.org
Evaluating the relational join is one of the central algorithmic and most well-studied
problems in database systems. A staggering number of variants have been considered …

FAST: fast architecture sensitive tree search on modern CPUs and GPUs

C Kim, J Chhugani, N Satish, E Sedlar… - Proceedings of the …, 2010 - dl.acm.org
In-memory tree structured index search is a fundamental database operation. Modern
processors provide tremendous computing power by integrating multiple cores, each with …

Design and evaluation of main memory hash join algorithms for multi-core CPUs

S Blanas, Y Li, JM Patel - Proceedings of the 2011 ACM SIGMOD …, 2011 - dl.acm.org
The focus of this paper is on investigating efficient hash join algorithms for modern multi-
core processors in main memory environments. This paper dissects each internal phase of a …

Meet the walkers: Accelerating index traversals for in-memory databases

O Kocberber, B Grot, J Picorel, B Falsafi, K Lim… - Proceedings of the 46th …, 2013 - dl.acm.org
The explosive growth in digital data and its growing role in real-time decision support
motivate the design of high-performance database management systems (DBMSs) …