Secure Network using Secure Hash Algorithm-3 with Locking Protocol in Distributed Database System

  title={Secure Network using Secure Hash Algorithm-3 with Locking Protocol in Distributed Database System},
  author={Prerna Gupta and Amit Verma and Basant Kumar Verma},
The two phase locking protocol provides controlled access to a data item and prevents data inconsistencies in the distributed database system. The hashing algorithm is used to calculate hash value for the requested data item and the generated hash value is used as a medium to secure the communication between server and client connected through a network. This paper presents a methodology which is used to secure network of a distributed database system while processing requests for data items… 

Figures and Tables from this paper



Concurrency Control and Security Issue in Distributed Database System

Some algorithm based of concurrency control such as basic timestamp algorithm, distributed two phase locking protocol (2PL), distributed optimistic protocol, wound-wait algorithm are reviewed.

Hash Based Incremental Optimistic Concurrency Control Algorithm in Distributed Databases

A new hash based optimistic concurrency control (HBOCC) approach is presented, where it is estimated to produce reliable results and overcomes inefficiencies like unnecessary restarts and improves the performance.

An Advanced Approach of Local Counter Synchronization to Timestamp Ordering Algorithm in Distributed Concurrency Control

An advanced approach is proposed to overcome disadvantages of low performance by giving out another measure so-called active number that is responsible for harmonizing local counters among distributed sites and applying minimum spanning tree into reduce cost of broadcasting messages over distributed network.

A comparative study of some concurrency control algorithms for cluster-based communication networks

Extending Speculation-Based Protocols for Processing Read-Only Transactions in Distributed Database Systems

The proposed protocols reduce the waiting time of ROTs significantly by increasing the parallelism without violating both correctness and data currency aspects and significantly improve the performance over 2PL and SI-based protocols.

Speculative locking protocols to improve performance for distributed database systems

These SL variants that process transactions efficiently by significantly reducing the number of speculative executions significantly improve the performance over two-phase locking in the DDBS environments where transactions spend longer time for processing and transaction-aborts occur frequently.

Analysis and Comparison of Concurrency Control Techniques

This paper has simulated the current environment and has analysis the performance of various concurrency techniques, their advantages and disadvantages and making comparison of optimistic, pessimistic and multiversion techniques.

Concurrency Issues of Distributed Advance Transaction Process

This paper describes distributed database system and their transaction process, and describes advance-nested transactions where the transactions from one system interact with the Transactions from another system, to overcome the limitations of flat transaction model.

Concurrency Control in Distributed Database System

This paper reviews the coverage of concurrency control in Distributed Network and identifies the main challenges as preserving the ACID property atomicity, consistency, isolation and durability property when concurrent transactions perform read and write operation.

Improving the Performance of Read-Only Transactions Through Speculation

The proposed approach improves the performance of ROTs by trading extra computing resources without violating serializability as correctness criteria and the simulation results show that the throughput performance is improved significantly over 2PL and SI-based approaches with manageable extra resources.