International Journal of Engineering and Technology

The increase in the sharing of databases leads to the increase in the concurrency errors, which are termed as deadlocks. Many concurrency control techniques result in deadlocks, because these techniques require the transactions in the system to wait for one another. At this situation, an outside intervention is often required to resume the normal working. Therefore, some special procedures are needed to resolve the deadlock situation. A multilevel secure database protects the classified information from unauthorized users based on the classification of the data and clearance of the users. If we add multilevel security to databases then the system becomes more complicated and it becomes mandatory for us to resolve the problem like deadlock and concurrency. In these systems, there should be no covert channel and starvation during the coordination of transaction in secure databases. Here we present an algorithm for deadlock detection and recovery in multilevel secure database. The proposed algorithm takes into consideration the requirements and terminates the youngest transaction possible according to the security classes available.