Beena Gopalakrishnan, LekshmiBecher, AndreasWildermann, StefanMeyer-Wegener, KlausTeich, Jürgen2021-05-042021-05-0420212021http://dx.doi.org/10.1007/s13222-020-00363-7https://dl.gi.de/handle/20.500.12116/36414FPGAs are promising target architectures for hardware acceleration of database query processing, as they combine the performance of hardware with the programmability of software. In particular, they are partially reconfigurable at runtime, which allows for the runtime adaptation to a variety of queries. However, reconfiguration costs some time, and a region of the FPGA is not available for computations during its reconfiguration. Techniques to avoid or at least hide the reconfiguration latencies can improve the overall performance. This paper presents optimizations based on query look-ahead, which follows the idea of exploiting knowledge about subsequent queries for scheduling the reconfigurations such that their overhead is minimized. We evaluate our optimizations with a calibrated model for various parameter settings. Improvements in execution time can be “calculated” even if only being able to look one query ahead.FPGAsHardware accelerationQuery optimizationReconfigurationText/Journal Article10.1007/s13222-020-00363-71610-1995