Generalized Spiral Storage based on Spiral Storage is one of the dynamic hashing schemes and its performance is better than that of Linear Hashing. While there has been concurrency control algorithm proposed in Linear Hash file, similar solution for Generalized Spiral Storage file have not appeared.
This thesis proposes a concurrency control algorithm in Generalized Spiral Storage file that is based on locking protocols. The proposed concurrency control algorithm is deadlock free and allows the find operations to proceed with the insert and delete operations even if the data structure is being modified. The proposed algorithm and concurrency control algorithm in Linear Hash file are simulated under the same assumption to evaluate the performance of these algorithms. Simulation results with regard to the average processing time are analyzed.
