{'fraction_non_alphanumeric': 0.010526315789473684, 'fraction_numerical': 0.0, 'mean_word_length': 5.620253164556962, '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}}
On Optimistic Methods for Mobile Transactions

We propose a new transaction execution model in a mobile environment where a subset of data items is cached by each mobile host. This execution model allows each mobile host to execute transactions locally and, before their commits, to request certification from the database server on the wired network. The database server certifies a commit request only when the execution of its pertaining transaction was consistent. This protocol behaves like the optimistic concurrency control mechanisms in traditional transaction processing systems. However, traditional optimistic algorithms cannot be applied directly to mobile environments. We propose three strategies for validation of commit requests by the database server. These strategies aim to minimize both the processing overhead and transaction abort ratio. We compare the performance of the proposed strategies via both complexity analysis and simulation and suggest guidelines for choosing the best algorithm for different operating regions.