Transactions and concurrency management, Database Management System

Assignment Help:

Transactions And Concurrency Management

 Introduction

One of the main benefits of storing data in an integrated repository or a database is to permit sharing of it between multiple users. Various users access the database or perform transactions at the similar time. What if a user's transactions try to access a data item that is being used /modified by another transaction? This unit attempts to give details on how concurrent transactions are implemented under the control of DBMS. Though, in order to describe the concurrent transactions, first we must explain the term transaction.

Concurrent implementation of user programs is essential for good performance of DBMS, as concurrent running of various user programs keeps utilizing CPU time efficiently, as disk accesses are frequent and are relatively slow in case of DBMS. Also, a user's program may carry out a lot of operations on the data returned from DB, but DBMS is only concerned about what data is being written from / read / into the database.

 


Related Discussions:- Transactions and concurrency management

What is storage manager, What is storage manager?  A  storage  manager ...

What is storage manager?  A  storage  manager  is  a  program  module  that  gives  the  interface  between the Low level data  kept in a database and the application programs

Explain the fundamental concepts of object-orientation, Explain the Fundame...

Explain the Fundamental concepts of object-orientation Software developers, data base administrators (DBAs) need to be familiar with fundamental concepts of object-orientation.

Describe analysis of access paths, Describe analysis of access paths To...

Describe analysis of access paths To describe analysis of access paths, consider an example of the design of a company's employee skills database. A part of the object model fr

What are the technique to define a schema completely, What are the techniqu...

What are the technique to define a schema completely ? A schema is completely define by DDL and DML query language.

What is deadlock, What is deadlock? Neither of the transaction can ever...

What is deadlock? Neither of the transaction can ever proceed with its normal implementation. This situation is known as deadlock.

Having clause-data manipulation language, Having clause This clause...

Having clause This clause is used for producing conditions on grouped information. Example: Find maximum salary and department number of those departments where maxim

Case snerio, each publisher has uniqe name a mial addrs are also kept on ea...

each publisher has uniqe name a mial addrs are also kept on each pubisher.a publisher publish one book.a book publish y one publisher.book identified by isbn.each book writn by one

Define weak and strong entity sets, Define weak and strong entity sets? ...

Define weak and strong entity sets? Weak entity set: entity set that do not have key attribute of their own are known as weak entity sets. Strong entity set: Entity set that

What is primary key, What is Primary key? Primary Key - Primary key i...

What is Primary key? Primary Key - Primary key is one of the candidate keys which uniquely identifies each row in the relation.

Explain sorted file with advantages, Explain sorted File with advantages? ...

Explain sorted File with advantages?  Sorted file The sort utility shall perform one of the subsequent functions: 1.Sort lines of all the named files together and write the

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd