{'fraction_non_alphanumeric': 0.02220726783310902, 'fraction_numerical': 0.004037685060565276, 'mean_word_length': 5.327659574468085, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Accelerated join evaluation in Semantic Web databases by using FPGAs

While the amount of information steadily increases, the requirements on the response time to query these information become more strict. Under those conditions, conventional database systems reach their limits and cannot meet these performance requirements anymore. In recent years, systems with many processing cores are considered to satisfy these demands. Furthermore, these systems include more and more heterogeneous cores tailor‐made to solve one specific task in an efficient manner. However, dedicated hardware accelerators are inflexible and cannot be adapted to the requirements of a dedicated query. Thus, the challenge is orchestrating the diversity of the functionality of all the cores to be optimized for performance/energy efficiency. In this paper, a concept is introduced on how to develop a flexible Field‐Programmable Gate Arrays (FPGA)‐based hardware accelerator to improve the performance of query evaluation in a Semantic Web database. As a first step to the hardware/software system, several joint algorithms are implemented on an FPGA and evaluated against a well‐developed software solution (implemented in C). The comparison shows a significant speedup of up to 10 times. Because of the complexity of the join operator, it is promising that the overall performance of query evaluation can be further enhanced by processing whole queries on an FPGA. Copyright © 2015 John Wiley & Sons, Ltd.