{'fraction_non_alphanumeric': 0.014285714285714285, 'fraction_numerical': 0.0, 'mean_word_length': 5.371900826446281, '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}}
Combining Cache and Priority Queue to Enhance Evaluation of Similarity Search Queries

A variety of applications have been using content-based similarity search techniques. Higher effectiveness of the search can be, in some cases, achieved by submitting multiple similar queries. We propose new approximation techniques that are specially designed to enhance the trade-off between the effectiveness and the efficiency of multiple k-nearest-neighbors queries. They combine the probability of an indexed object to be a part of the precise query result and the time needed to examine the object. This enables us to improve processing times while maintaining the same query precision as compared to the traditional approximation technique without the proposed optimizations.