{'fraction_non_alphanumeric': 0.03314393939393939, 'fraction_numerical': 0.0, 'mean_word_length': 5.145348837209302, '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}}
An efficient method for queries execution in a multi-user environment

In a multi-user environment, multiple queries co-exist together in the system. Further, we observe that these queries usually share common sub-queries or reference common relations. By using cached results from earlier queries, better performance as well as faster evaluation of subsequent queries can be achieved. One promising concept that has been recently proposed is the cache-on-demand (CoD) schemes. CoD considers intermediate/final results of existing running queries as virtual caches, of which only the beneficial ones are materialized for incoming queries. In this paper, we propose a novel CoD-based strategy called Integrated-CoD. Unlike existing CoD-based schemes that operate in two phases, Integrated-CoD integrates the two phases into one. We evaluated the performance of Integrated-CoD against two known CoD-based schemes (Conform-CoD and Scramble-CoD). Our results show that Integrated-CoD offers superior performance at a marginal increase in optimization overhead.