A Study of Early Aggregation in Database Query Processing on FPGAs.

Research output: Contribution to book/conference proceedings/anthology/reportConference contributionContributedpeer-review



In database query processing, aggregation is an operator by which data with a common property is grouped and expressed in a summary form. Early aggregation is a popular method for improving the performance of the aggregation operator. In this paper, we study early aggregation algorithms in the context of query processing acceleration in database systems on FPGAs. The comparative study leads us to set-Associative caches with a low inter-reference recency set (LIRS) replacement policy. They show both great performance and modest implementation complexity compared to some of the most prominent early aggregation algorithms. We also present a novel application-specific architecture for implementing set-Associative caches. Benchmarks of our implementation show speedups of up to 3x for end-To-end aggregation compared to a state-of-The-Art FPGA-based query engine.


Original languageEnglish
Title of host publicationFPGA 2023 - Proceedings of the 2023 ACM/SIGDA International Symposium on Field Programmable Gate Arrays
Number of pages11
ISBN (electronic)9781450394178
Publication statusPublished - 12 Feb 2023

External IDs

Scopus 85148637560
Mendeley ab40a993-ba7b-3072-93d4-9a3c0758b8e9
ORCID /0000-0001-8107-2775/work/142253562


DFG Classification of Subject Areas according to Review Boards

Subject groups, research areas, subject areas according to Destatis


  • FPGA, aggregation, cache, database, early aggregation