{'fraction_non_alphanumeric': 0.01634877384196185, 'fraction_numerical': 0.0, 'mean_word_length': 4.989130434782608, '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}}
Agreement Protocols for a Dataspace System

Dataspace is the co-existence of a number of heterogeneous data sources which are not controlled by a single data source. Each data source has complete control over its data. The data in a dataspace come from various data sources distributed over various places, and these data may update periodically. Therefore, whenever a participant of dataspace get update, the changes must reflected in database if updated data is already populated. To provide stronger update guarantee in the dataspace is a challenging issue, and can be achieved by making an agreement among the owners of various data sources. The proposed work has presented the concept of agreement protocol suitable for a dataspace system. Our protocol defines two threshold values of data populated in the dataspace. On the basis of threshold values, the dataspace coordinator would decide whether the changes occur in data sources may get reflected on dataspace or not. The protocol is divided into a pull-based and push-based approach, also called reactive and proactive approach respectively.