{'fraction_non_alphanumeric': 0.0195712954333644, 'fraction_numerical': 0.0, 'mean_word_length': 5.172413793103448, '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}}
Concurrent Search Tree by Lazy Splaying

In many search tree (maps) applications the distribution of items accesses is non-uniform, with some popular items accessed more frequently than others. Traditional self-adjusting tree algorithms adapt to the access pattern, but are not suitable for a concurrent setting since they constantly move items to the tree’s root, turning the root into a sequential hot spot. Here we present lazy splaying, a new search tree algorithm that moves frequently accessed items close to the root without making the root a bottleneck. Lazy splaying is fast and highly scalable making at most one local adjustment to the tree on each access. It can be combined with other sequential or concurrent search tree algorithms. In the experimental evaluation we integrated lazy splaying into Bronson et. al.’s optimistic search tree implementation to get a concurrent highly scalable search tree, and show that it significantly improves performance on realistic non-uniform access patterns, while only slightly degrading performance for uniform accesses.