{'fraction_non_alphanumeric': 0.016230838593327322, 'fraction_numerical': 0.0, 'mean_word_length': 5.607142857142857, '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}}
Always the Best: Executing Transitions between Search Overlays

Search overlays are distributed systems which allow to easily store and retrieve data shared across a huge number of nodes. A multitude of search overlays exist, each optimized for certain environments, application requirements, and workloads. However, in highly dynamic and heterogeneous environments, the choice of the most suitable overlay changes frequently. In this paper, we propose to execute transitions between search overlays at runtime. This approach allows for switching to the most suitable overlay depending on the requirements and the environment. We analyze how these transitions can be executed and propose multiple transition strategies that differ in their required time, their overhead, and the provided performance during the transition. For the evaluation, we exemplarily executed these transition strategies for two overlays and verified the expected performance properties of the strategies. We show that transitions between search overlays are possible and can be used to always execute the most suitable search overlay.