{'fraction_non_alphanumeric': 0.027540360873694207, 'fraction_numerical': 0.000949667616334283, 'mean_word_length': 5.713375796178344, '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}}
Semantics-based asynchronous speculative locking protocol for improving the performance of read-only transactions

Speculative locking (SL) protocols have been proposed in the literature for improving the performance of read-only transactions (ROTs) without correctness and data currency issues. In these protocols, ROTs carry out speculative executions and update transactions (UTs) follow two-phase locking (2PL). In these protocols, UTs are blocked if they conflict with ROTs. To reduce blocking of UTs, semantics-based protocol has been proposed in the literature by exploiting the "compensatability" property of ROTs. In that protocol compensatable ROTs are processed without blocking and non-compensatable ROTs are processed by using synchronous speculation method. In this paper, we have proposed a semantics-based speculative locking protocol for ROTs in which non-compensatable ROTs are processed with asynchronous speculation method. The simulation results show that the proposed approach improves the performance of ROTs over other protocols.