{'fraction_non_alphanumeric': 0.029118136439267885, 'fraction_numerical': 0.0024958402662229617, 'mean_word_length': 5.137755102040816, '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}}
Atomicity for P2P based XML Repositories

Over the years, the notion of transactions has become synonymous with providing fault-tolerance, reliability and robustness to database systems. However, challenges arise when we try to apply them to novel computing paradigms such as ActiveXML (AXML) systems. AXML provides an elegant platform to integrate the power of XML, Web services and Peer to Peer (P2P) paradigms by allowing (active) Web services calls to be embedded within XML documents. We propose a transactional framework which provides relaxed ACID properties to AXML systems. Relaxed atomicity is usually provided with the help of compensation. However, current compensation based models assume the existence of a pre-defined compensating operation. Also, compensation is assumed to be more or less peer (or service provider) dependent, i.e.. the original and compensating services are provided by the same peer. We show how compensation for AXML transactions can be constructed dynamically at run-time and achieved in a peer independent manner. Finally, we consider the issue of peer disconnection, an inherent trait of P2P systems, and propose an innovative solution based on peer "chaining ".