{'fraction_non_alphanumeric': 0.02241793434747798, 'fraction_numerical': 0.016813450760608487, 'mean_word_length': 4.76036866359447, '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}}
A fully-pipelined hash table achieving low-latency and high throughput key-value retrieving system

Key-value store (KVS) systems are widely used in various network applications for retrieving a block of data called value according to an indicator called key. Hash table is often used as implementations of key-value stores for its high retrieving efficiency. However, the conventional implementations of hash tables are based on software, which introduce high latency and loss of requests for high speed Ethernet accesses. We present a hash table with optimized fully pipelined design for high throughput and low latency key-value accesses. This hash table inserts entries at the rate of 100 million requests per second (MRPS) when the load factor is less than 60% and retrieves or deletes entries at a constant rate of 100 MRPS. The integration with Ethernet and off-chip memories achieves 10Gbps line rate processing of requests and proves that our hash table is over-provisioned. The KVS system can handle the throughput beyond 10 Gbps, serving a maximum packet rate of 46 MRPS, which is 1.5 times faster than the best published result. The retrieve latency can be reduced down to 230ns, which is 2.5 times faster than the best published result.