Ask DBMS Expert


Home >> DBMS

Part -1:

1. Review questions

(a) What is the two-phase locking protocol? How does it guarantee serializability?

(b) Describe the wait-die and wound-wait protocols for deadlock prevention.

(c) Describe the cautious waiting, no waiting, and timeout protocols for deadlock prevention.

(d) What is a timestamp? How does the system generate timestamp?

2. Modify the data structure for multiple-mode locks (shared and exclusive) and the algorithm for read_lock(X), write_lock(X), and unlock(X) so that upgrading and downgrading of locks are possible. (The lock and unlock operations can be found on the course page under "figures for Chapter 20"; Hint: The lock needs to check the transaction id(s) that hold the lock, if any.) (20)

read_lock (X):

  B: if LOCK (X)="unlocked"

  then begin LOCK (¬ X) "read-locked"; no_of_reads(X) 1

  end

  else if LOCK(X)="read-locked"

  then no_of_reads(X) ¬ no_of _reads(X) + 1

  else begin wait (until LOCK (X)="unlocked" and

  the lock manager wakes up the transaction);

  go to B

  end;

write_lock (X):

  B: if LOCK (X)="unlocked"

  then LOCK (X) ¬ "write-locked"

  else begin

  wait (until LOCK(X)="unlocked" and

  he lock manager wakes up the transaction);

  go to B

  end;

unlock_item (X):

  if LOCK (X)="write-locked"

  then begin LOCK (X) "unlocked;" wakeup one of the waiting transactions, if any

  end

  else if LOCK(X)="read-locked"

  then begin

  no_of_reads(X) ¬ no_of_reads(X) - 1;

  if no_of_reads(X)=0

  then begin LOCK (X)="unlocked"; wakeup one of the waiting transactions, if any

  end

  end;

3. Apply the timestamp ordering algorithm to the schedules of Figure 19.8(b) and (c), and determine whether the algorithm will allow the execution of the schedules. (the figures can be found on the course page under "figures for chapter 19".)

186_Spatial and Temporal Data Management.png

4. The compatibility matrix of Figure 20.8 shows that IS and IX locks are compatible. Explain why this is valid. (the figures can be found on the course page under "figures for chapter 20".)

5. What is ‘certify' lock? Explain why this kind of locks is needed for multiversion 2PL.


IS IX S SIX X

yes yes yes yes no
IX yes yes no no no 
S yes no yes no no 
SIX yes no no no no 
X no no no no no 

Part -2:

1. What is the shadow paging principle? Assume that a database contains 7 pages and during the execution of a transaction page 5 and 1 are changed. Give the structures of the current directory and shadow directory before and after the transaction execution, respectively.

2. (a) Consider the five types of transactions given in Fig. 1. If "deferred update" strategy is used, which needs to be redone after the crash?

(b) Consider the five types of transactions given in Fig. 1. If "immediate update" strategy is used, which needs to be undone/redone after the crash?

1939_Spatial and Temporal Data Management1.png

3. (a) Discuss the two main types of constraints on specializations and generalization.

(b) How does a category differ from a regular shared subclass?

(c) Map the EER diagram shown in Fig. 4.1 into a relational schema.

4. Construct an R-tree over a set of records for geographical objects with the following coordinates [(x1, y1), (x2, y2)]:

[(0, 40), (60, 50)] ---- road1
[(40, 0), (60, 40)] ---- road2
[(15, 25), (35, 35)] ---- house1
[(70, 40), (80, 50)] ---- house2
[(70, 5), (80, 15)] ---- house3
[(35, 25), (80, 35)] ---- pipeline

Assume that each node (either leaf or interior) can store 3 entries.

5. Given the spatial database shown in the lecture notes on Spatial and Temporal Data Management. Design an SQL statement to find all the cities which are closer to Limerick than to Dublin.

DBMS, Programming

  • Category:- DBMS
  • Reference No.:- M91565047
  • Price:- $90

Guranteed 48 Hours Delivery, In Price:- $90

Have any Question?


Related Questions in DBMS

Data mining assignment -in this assignment you are asked to

Data Mining Assignment - In this assignment you are asked to explore the use of neural networks for classification and numeric prediction. You are also asked to carry out a data mining investigation on a real-world data ...

Sql query assignment -for this assignment you are to write

SQL Query Assignment - For this assignment you are to write your answers in a word document. This assignment is in three parts: Part A (reporting queries), Part B (query performance), Part C (query design). For this assi ...

The groceries datasetimagine 10000 receipts sitting on your

The groceries Dataset Imagine 10000 receipts sitting on your table. Each receipt represents a transaction with items that were purchased. The receipt is a representation of stuff that went into a customer's basket. That ...

You are in a real estate business renting apartments to

You are in a real estate business renting apartments to customers. Your job is to define an appropriate schema using SQL DDL in MySQL. The relations are Property(Id, Address, NumberOfUnits), Unit(ApartmentNumber, Propert ...

Objectivethe objective of this lab is to be familiar with a

OBJECTIVE: The objective of this lab is to be familiar with a process in big data modeling. You're required to produce three big data models using the MS PowerPoint software. This tool is available on UMUC Virtual Deskto ...

The relation memberstudentid organizationid roleid stores

The relation Member(StudentId, OrganizationId, RoleId) stores the membership information of student joining organization. For example, ('S1', 'O2', 'R3') indicates that student with Id 'S1' joined the organization with i ...

Relational database exerciseyou have been assigned to a new

Relational Database Exercise: You have been assigned to a new development team. A client is requesting a relational database system to manage their present store with the anticipation of adding more stores in the future. ...

Relational database design a given the following business

Relational Database Design A) Given the following business rules, identify entity types, attributes (at least two attributes for each entity, including the primary key) and relationships, and then draw an Entity-Relation ...

We can represent a data set as a collection of object nodes

We can represent a data set as a collection of object nodes and a collection of attribute nodes, where there is a link between each object and each attribute, and where the weight of that link is the value of the object ...

Data model development and implementationpurpose of the

Data model development and implementation Purpose of the assessment (with ULO Mapping) The purpose of this assignment is to develop data models and map Database System into a standard development environment to gain unde ...

  • 4,153,160 Questions Asked
  • 13,132 Experts
  • 2,558,936 Questions Answered

Ask Experts for help!!

Looking for Assignment Help?

Start excelling in your Courses, Get help with Assignment

Write us your full requirement for evaluation and you will receive response within 20 minutes turnaround time.

Ask Now Help with Problems, Get a Best Answer

Why might a bank avoid the use of interest rate swaps even

Why might a bank avoid the use of interest rate swaps, even when the institution is exposed to significant interest rate

Describe the difference between zero coupon bonds and

Describe the difference between zero coupon bonds and coupon bonds. Under what conditions will a coupon bond sell at a p

Compute the present value of an annuity of 880 per year

Compute the present value of an annuity of $ 880 per year for 16 years, given a discount rate of 6 percent per annum. As

Compute the present value of an 1150 payment made in ten

Compute the present value of an $1,150 payment made in ten years when the discount rate is 12 percent. (Do not round int

Compute the present value of an annuity of 699 per year

Compute the present value of an annuity of $ 699 per year for 19 years, given a discount rate of 6 percent per annum. As