{'fraction_non_alphanumeric': 0.036637931034482756, 'fraction_numerical': 0.0, 'mean_word_length': 4.955128205128205, '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}}
RP: A Family of Order Preserving Scalable

Hash-based scalable distributed data structures (SDDSs), like LH* or DDH, for networks of interconnected computers (multi- computers) were shown to open new perspectives for file management. We propose a family of ordered SDDSs, called RP*, providing for ordered and dynamic files on multicomputers, and thus for more efficient processing of range queries and of ordered traversals of files. The basic algorithm termed RP* N, builds the file with the same key space range partitioning as a B-tree, but avoids indexes through the use of multicast. The algorithms, RP*c and RP*s enhance the throughput for faster networks, adding the indexes on clients, or on clients and servers, decreasing or avoiding the multicast. RP files are shown highly efficient with access performance exceeding traditional files by an order of magnitude or two, and, for non- range queries, very close to LH*.