Hash based incremental optimistic concurrency control algorithm in distributed databases

Abstract

In this paper, we present a methodology that represents an excellent blossom in the concurrency control environment. It deals with anomalies and assures the reliability of the data before read-write transactions after their successful commitment. This method is based on the calculation of hash value of the data field and compares the current hash value with the previous hash value every time before the write operation takes place. We show that this method overcomes inefficiencies like unnecessary restarts and improves the performance. Finally, this work finds a need for an adaptive optimistic concurrency control method in distributed databases. Thus, a new hash based optimistic concurrency control (HBOCC) approach is presented, where it is estimated to produce reliable results. By performing extensive experiments, we epitomize the performance of this method with existing modalities.