{'fraction_non_alphanumeric': 0.020190023752969122, 'fraction_numerical': 0.004750593824228029, 'mean_word_length': 4.9787234042553195, '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}}
On the Trade-Off Between Performance and Storage Efficiency of Replication-Based Object Storage

The object storage systems are used to store and manage unstructured data. Most object storage systems provide the replication policy (REP) or erasure code policy (EC) to ensure the reliability and availability of data. In this paper, we study the trade-off between performance and storage efficiency of these policies with respect to different data sizes of user requests. To this end, we present a hybrid policy management system that takes advantage of both policies by automatically changing policy based on data size. We have implemented the hybrid system in OpenStack Swift. Our evaluation results show the throughput of GET request increases up to 36% while improving storage efficiency by up to 53% compared to that using the REP policy.