Monday 19th of February 2018

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

Prerna Gupta, Amit Verma and B.K.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 from various users at the same time. The concurrency control issues are resolved using two phase locking protocol and the security issue is resolved using secure hash algorithm-3, 512 variant. By performing extensive experiments, the performance of the proposed method is epitomized. Performance parameters like throughput, accuracy are calculated to compare the proposed methodology with the hash based optimistic concurrency control algorithm.

Keywords: Database (DB), Distributed Databases (DDB), Distributed Database Management System (DDBMS), Distributed Database System (DDS), Concurrency Control, Hashing, Secure Hash Algorithm-3 (SHA-3), Transaction Manager (TM), Scheduler (SC), Data Manager (DM)

Download Full-Text


Prerna Gupta
Mtech scholar, Computer Science & Engineering, Chandigarh Engineering College, Landran.

Amit Verma
Professor & Head of Department, Computer Science & Engineering, Chandigarh Engineering College, Landran

Dean Academics & Associate Professor, Computer Science & Engineering, Chandigarh Engineering College, Landran

IJCSI Published Papers Indexed By:





IJCSI is a refereed open access international journal for scientific papers dealing in all areas of computer science research...

Learn more »
Join Us

Read the most frequently asked questions about IJCSI.

Frequently Asked Questions (FAQs) »
Get in touch

Phone: +230 911 5482

More contact details »