{'fraction_non_alphanumeric': 0.01608910891089109, 'fraction_numerical': 0.0, 'mean_word_length': 4.905109489051095, '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 linear hashing enabling efficient retrieval for range queries

For efficient retrieval of data, design of the data structuring is important. Tree structures and hash tables are popular data structures. A hash table is a simple data structure and it can be retrieved very fast for an exact match query. But for a range query, the hashing scheme is necessary to search much more data blocks than other data structures. In this paper, in order to overcome this problem, the order-preserving linear hashing scheme is proposed. This hashing scheme is based on linear hashing which uses specific hash function enabling efficient retrieval for range queries. By comparing the proposed hashing scheme with the traditional linear hashing scheme, our scheme proves to provide better retrieval time for range queries.