Objectives-transactions and concurrency management, Database Management System

Objectives

After Reading this part, you should be able to:

  • Explain the term CONCURRENCY;
  • Describe the term transaction and concurrent transactions;
  • Talk about concurrency control mechanism;
  • Define the principles of locking and serialisability, and
  • Define concepts of deadlock & its prevention.

 

 

Posted Date: 3/11/2013 5:17:23 AM | Location : United States







Related Discussions:- Objectives-transactions and concurrency management, Assignment Help, Ask Question on Objectives-transactions and concurrency management, Get Answer, Expert's Help, Objectives-transactions and concurrency management Discussions

Write discussion on Objectives-transactions and concurrency management
Your posts are moderated
Related Questions
What sorts of tables one can se in designing the hierarchy of a LDB? Tables, which are having Foreign Key relations.

What is B-Tree? A B-tree eliminates the redundant storage of search-key values .It permits search key values to appear only once.

The ER diagram clearly showing the additional tables you have implemented. SQL table creation scripts for the tables you have set up. SQL scripts showing the sample data you

Authorisation Authorisation is the culmination of the administrative policies of the organisation.  As the name shows, authorisation is a set of rules that can be used to verif

Describe Embedded Query Language? Embedded Query Language - A query language (e.g., SQL) can be implemented in two ways. It can be used interactively or embedded within a host

Domain Constraints Domain constraints are primarily formed for defining the logically correct values for an attribute of a relation. The relation allows attributes of a relatio

Which two tools are used to administer users for Active Directory?

Deadlock And Its Prevention: As seen earlier, though two phase locking protocol handles the trouble of serialisability, but it causes some troubles also. For instance, consider th

Explain Strict Two-Phase locking A transaction T does not release any type of its exclusive (X) locks until that transaction commits or aborts. In this method no other transact

Define Atom of domain relational calculus An atom has the outline 1 , x 2 , ... , x n > -> r , in which r stands for a relation on n attributes and x 1 , x 2 , ... , x n ar