Professional Documents
Culture Documents
NR-320505-Data Base Management Systems
NR-320505-Data Base Management Systems
1
III B.Tech. II-Semester Supplementary Examinations, November-2003
3. Consider a book base with 50000 books, 10000 authors, 10 publishers, 20000
titles and 50 suppliers. Compile the storage requirement and accession time for
(a) hashed file organization (b) index file organization.
5.a) Why is it not desirable to force users to make an explicit choice of a query
processing strategy? Are there cases in which it is desirable for users to be aware
of the costs of competing query processing strategies? Explain.
b) What are the advantages and disadvantages of hash indices relative to B+ - tree
indices? How the type of index available influences the choice of query
processing strategy?
7.a) What information does the dirty page table and transaction table contain?
b) Give a short notes on recovery from deadlock.
-*-*-*-
Code No: 320505 Set No.
2
III B.Tech. II-Semester Supplementary Examinations, November-2003
2.a) Consider the following schema given. The primary keys are underlined.
Sailors(sailor-id, sailor-name, sailor-rating, sailor-age)
Boats(boat-id, boat-name, boat-color)
Reserves(sailor-id, boat-id, day)
Write the Nested queries in SQL.
(i) Find the names of sailors who have reserved boat number 120
(ii) Find the names of sailors who have reserved a green boat
(iii) Find the names of sailors who have not reserved a green boat
(iv) Find the names of sailors with the highest rating
b) Explain the GROUP BY and HAVING clauses.
3.a) Explain the limitations of static hashing. Explain how this is overcome in
dynamic hashing.
b) Write a note on indexed sequential files.
4. Discuss the merits and demerits of hash join, sort-merge join and block nested
loops join.
6.a) Decompose the relation R(A,B,C,D,E,F) with the following set of FDs into a
BCNF relation. FDs of the relation are
ABC->DE
AB->D
DE->ABCE
E->C
Is the decomposition lossless and dependency preserving.
b) “A decomposition in BCNF may be lossless and dependency preserving” is the
above statement correct? Explain with the help of an example to justify your
answer. How can BCNF be compared to 4NF?
(Contd…2)
Code No:320505 :: 2 :: Set No.2
7.a) Define the concept of a schedule for a set of concurrent transactions. Give a
suitable example.
b) Explain how does granularity of locking affect the performance of concurrency
control algorithm.
8. Explain WAL Protocol, UNDO algorithm, Check pointing and Media Recovery?
-*-*-*-
Code No: 320505 Set No.
3
III B.Tech. II-Semester Supplementary Examinations, November-2003
3.a) Describe three popular file organization techniques on disks and compare them.
b) Discuss the process of disk initialization.
5.a) Discuss the reasons for converting SQL queries into relational algebra queries
before optimization is done.
b) What is meant by query execution plan? Explain its significance.
(Contd…
2)
Code No:320505 :: 2 :: Set No.3
7. Explain the role of concurrency control in databases. Also describe the basic tree
protocol that ensures serializability of concurrent transactions.
8.a) Explain the difference between Log-based Crash recovery techniques and Shadow
paging.
b) What are the different types of System Failures?
-*-*-*-
Code No: 320505 Set No.
4
III B.Tech. II-Semester Supplementary Examinations, November-2003
2.a) Is QBE based upon relational algebra, tuple relational calculus, or domain
relational calculus ? Explain.
b) Is QBE relationally complete ? Explain.
c) What restrictions does QBE pose on update commands? Explain with example.
3.a) What are the differences between static and dynamic files.
b) Discuss the techniques for allocating file blocks on disk.
5. Discuss different types of parameters that are used in cost functions. Where is
this information kept?
6.a) Suppose the scheme R =(A,B,C,D,E) is decomposed into (A,B,C) and (A,D,E),
show that the decomposition is not a dependency preserving decomposition if the
following set of functional dependencies hold.
A->BC
CD->E
B->D
E->A
b) List all functional dependencies satisfied by the following relation
A B C
a1 b1 c1
a1 b1 c2
a2 b1 c1
a2 b1 c3
(Contd…2)
Code No:320505 :: 2 :: Set No.4
8.a) If a system fails repeatedly during recovery, what is the maximum number of
log records that can be written (as a function of number of update and other
log records written before crash) before restart completes successfully.
b) What is the oldest log record that we need to retain?
c) If a bounded amount of stable storage is needed for the log, how can we ensure
that there is always enough stable storage to hold all log records written during
restart?
-*-*-*-