GTU MCA MATERIAL FOR DBMS II

RSS
  • Home
  • Quick Review
  • Assignment
  • Backup and Recovery
  • Differences
  • About Me

Wednesday, February 23, 2011

Assignment-2 Concurrency Control


620006 (DBMS-II)    Assignment-2 Concurrency Control  
Submission Date : 08-03-2011
 
Q-1. Explain the Following Questions.

1). What is Concurrency Control? Why it is needed ? What is its importance?
2). Explain different problem of Concurrency control with and example?
3). What is Serializability? What is its objective?
4). What is locking? What are the Different types of Lock? Explain different level of locking?
5). How does Locking Protocol work?
6). What are the disadvantage of Basic locking protocal? What is Advantage of two phase locking?
7). How does 2PL work?
8). What is Deadlock? How are deadlock handled? What is deadlock prevention? What is deadlock detection and Recovery? Explain with an Example.
9). What is Timestamp Ordering protocol?
10). How does Timestamp Ordering protocol work? Explain with an example?
11). What is Thomas’s write rule and why is it important? (Ignore Obsolete Write Rule)
12). What are the different phases in a validation based concurrency technique?
13). How does validation based concurrency technique work? (Optmistic Technique)
14). What is cascading rollback? Explain with an Example?
15). Define the terms : Lock Point, Strict 2PL, Starvation

Q.2. Differentiate the following :

1). Dirty Read Vs Unrepeatable Read
2). Serial Schedule Vs Non-Serial Schedule
3). Lost Update Vs Uncommitted Data
4). Starvation Vs Deadlock

Q.3. State whether the following statements are true or false. Justify. No Justification, no marks.

1.    Level 1 transaction is the minimum consistency requirement that allows a transaction to be recovered in the event of system failure.
2.    There is no deadlock in the timestamp method of concurrency control.
3.    Level 0 transactions are recoverable.
4.    The objective of concurrency control is to schedule or arrange the transactions in such a way as to avoid any interference.
5.    In a shrinking phase, a transaction release all locks and can not obtain any new locks.

Posted by Dr. Parag Shukla at 2:14:00 AM
Email This BlogThis! Share to X Share to Facebook

0 comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

Total Pageviews

Blog Archive

  • ►  2019 (1)
    • ►  March (1)
  • ►  2016 (7)
    • ►  August (6)
    • ►  July (1)
  • ▼  2011 (16)
    • ►  May (2)
    • ►  April (6)
    • ►  March (5)
    • ▼  February (3)
      • Assignment-2 Concurrency Control
      • Assignment-1 Transaction Processing
      • DBMS-II Syllabus
  • ►  2010 (9)
    • ►  May (4)
    • ►  March (5)
  • ►  2009 (1)
    • ►  December (1)

Followers

Blog List

Search

Parag Shukla. Powered by Blogger.

Popular Posts

  • Serial Schedule Vs Non-Serial Schedule
    Serial Schedule Non-Serial Schedule A serial schedule is a sequence of operat...
  • Dirty Read Vs Unrepeatable Read
    Dirty Read Unrepeatable Read A dirty read problem occurs when one transaction updates a ...
  • Log Based Recovery
    Log Based Recovery The most widely used structure for recording database modification is the log. The log is a sequence of log ...
  • Lost Update Vs Uncommitted Data
    Lost Update Uncommitted Data This problem is also known as “Multiple Update...
  • Shadow Paging
    Shadow Paging This technique does not require LOG in single user environment In mult...
  • Starvation Vs Deadlock
    Starvation Deadlock Starvation happens if same transaction is always choosen ...
  • Checkpoints
    Checkpoints When System failure occurs o We must consult log to determine those transaction that need to be redone and those tra...
  • Defferred Update method
    Deferred update Do not physically update the database on disk until after a transaction reaches its commit point; Then updates are r...
  • Assignment - 7 Query Processing & Optimization
    Assignment – 7         Query Processing & optimization    Submission Date 30-05-11   Q-1. Explain th...
  • Immediate Update Method
    Immediate update technique Database may be updated by some operations of a transaction before the transaction reaches its commit poi...
Copyright © 2010 GTU MCA MATERIAL FOR DBMS II