{'fraction_non_alphanumeric': 0.034653465346534656, 'fraction_numerical': 0.0009900990099009901, 'mean_word_length': 5.564935064935065, '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}}
Fusing Relational Databases and P2P: A Resource Sensitive DHT Overlay

When traditional client-server data-management models (i.e. relational databases) are scaled problems arise. Peer-to-Peer technologies provide a good solution to these problems but have poor performance and weak data-management capabilities. This dissertation identifies three areas (content-based routing, distributed query processing and data semantics), discusses the motivation for research, highlights key issues and compares different solutions in each area. Many content-based routing (Distributed Hash Table (DHT)) schemes have been put forward; here a resource sensitive overlay (the resources considered are processing power, storage capacity, bandwidth, latency) is proposed which skews the identifier space. To evaluate the overlay a simulator was designed and implemented; the performance of Chord and the proposed overlay were tested. It was found that the skew improved the performance of DHT when using a time-based metric.