Scribd
Upload
330 views

BBIT 423 CISY 423 - Advanced Database Systems

This document contains instructions for an assignment on advanced database management systems for Kenya Methodist University. It provides details such as the deadline, lecturer contact information, and sections covering topics like concurrency control, transaction processing, query optimization, and indexing methods. Students are to answer multiple choice and short answer questions on these topics, with an emphasis on transaction processing concepts like conflict resolution, isolation levels, and preserving data consistency.

Uploaded by

Anyumba Kennedy Ochieng
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
330 views

BBIT 423 CISY 423 - Advanced Database Systems

This document contains instructions for an assignment on advanced database management systems for Kenya Methodist University. It provides details such as the deadline, lecturer contact information, and sections covering topics like concurrency control, transaction processing, query optimization, and indexing methods. Students are to answer multiple choice and short answer questions on these topics, with an emphasis on transaction processing concepts like conflict resolution, isolation levels, and preserving data consistency.

Uploaded by

Anyumba Kennedy Ochieng
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

KENYA METHODIST UNIVERSITY

CISY 423/ BBIT 423 ADVANCED DATATABASE MANAGEMENT SYSTEMS

DLM Assignment 2nd Trimester 2011


Deadline: 22nd July.

Lecturer Information

Stanley Githinji Email [email protected]

Section A
1. Define the term deadlock and outline the two main methods of dealing with a
deadlock problem. (3 marks)
2. Why are I/O costs important in a DBMS ( 2 marks)
3. If a DBMS already supports discretionary and mandatory access controls, is there
a need for encryption?
(3 marks)
4. Describe pipelining and its advantages ( 4 marks)
5. Explain the difference between logical and physical data independence (2
marks)
6. Describe the use of locks for improved conflict resolution in Optimistic
Concurrency Control.
(4 marks)
7. In the context of query optimization, what is an SQL query block? (2
marks)
8. Assuming that the DBA is never interested in running queries, does the DBA need
to understand query optimization? Why? (2
mks)
9. Name an important capability of a DBMS buffer manager that is not supported by
a typical operating system’s buffer manager. (2
marks)
10. Briefly describe how the recovery manager ensures atomicity of transactions and
durability? (2
marks)

11. Explain the difference between Hash indexes and B+-tree indexes. In particular,
discuss how equality and range searches work, using an example. (5
marks)
12. List the goal and importance of query optimization? (3 marks)

1
Section B

1. Consider a database with objects X and Y and assume that there are two
transactions T1 and T 2. Transaction T 1 reads objects X and Y and then writes
object X. Transaction T 2 reads objects X and Y and then writes objects X and Y .
i. Give an example schedule with actions of transactions T1 and T 2 on objects
X and Y that results in a write-read conflict.
ii. Give an example schedule with actions of transactions T1 and T 2 on objects
X and Y that results in a read-write conflict.
iii. Give an example schedule with actions of transactions T1 and T 2 on objects
X and Y that results in a write-write conflict.
iv. For each of the three schedules, show that Strict 2PL disallows the schedule.
( 15 Marks)
2. The consistency and reliability aspects of transactions are due to the ‘ACID’
properties of transactions. Discuss each of these properties and how they relate to
the concurrency control and recovery mechanisms. Give examples to illustrate
your answer.
3. What does the term Isolation Level mean? Discuss the four isolation levels that
are provided for in the ANSI/ISO SQL standard of 1992 (famously known as
SQL92) and give the general syntax used in setting an Isolation level.
(5 marks)
4. Consider the following two transactions:
T1: read (C);
read (B);
if A = 0 then B := B+1;
write (B).
T2: read(B);
read (A);
if B = 0 then A := A+1;
write (A).
Let the consistency requirement be (A=0 or B=0), with A = B = 0 initial values.
(i.) Show that every serial execution involving these two transactions
preserves the consistency of the database.
(ii.) Show a concurrent execution of T1 and T2 that produces a non-serializable
schedule. (4 marks)

You might also like