Semester : SEMESTER 4
Subject : Principles of Database Design
Year : 2018
Term : APRIL
Branch : COMPUTER SCIENCE AND ENGINEERING
Scheme : 2015 Full Time
Course Code : CS 208
Page:4
16
17
18
19
20
b)
8)
0)
०
a)
a)
b)
E4810 Pages: 4
Consider an EMPLOYEE file with 10000 records where each record is of
size 80 bytes. The file is sorted on employee number (15 bytes long), which
is the primary key. Assuming un-spanned organization, block size of 512
bytes and block pointer size of 5 bytes, compute the number of block
accesses needed for retrieving an employee record based on employee
number if (i) No index is used (ii)Multi-level primary index is used
How 15 a B-Tree structurally different from ೩ B+-Tree?
Write an explanatory note on clustering index by quoting an example.
Show two non-canonical query trees for the following relational algebra
expression:
1൩൧൧൧, ap (COURSE 04 ENROLL ൧9 STUDENT))
COURSE.CID-ENROLL.CNO = EROLL.ROLL#=STUDENT.ROLLNO
Consider three tables COURSE(CNO,CNAME,CREDITS),
STUDENT(ROLLNO,NAME,ADDRESS,SEM) and ENROLLMENT
(CNO,ROLLNO,GRADE). Foreign keys have the same name as primary
keys. Identify one initial canonical query tree for the following SQL
expression and show the steps to optimize it using heuristics. Assume that
CNAME is a candidate key.
SELECT S.NAME, S.ADDRESS, EGGRADE FROM COURSE ಲ, STUDENT
5, ENROLLMENT E WHERE S.ROLLNO =E.ROLLNO AND C.CNO =
E.CNO AND CNAME=’PDBD’
Determine if the following schedule is recoverable. Is the schedule cascade-
less? Justify your answer.
r1(X), r2(Z), r1(Z), r3(X), r3(Y), w1(X), cl, w3(Y), رتك r2(Y), w2(Z), w2(Y), c2
(Note: ri(X)/wi(X) means transaction Ti issues read/write on item X; ci
means transaction Ti commits.)
Discuss the four ACID properties and their importance.
Argue that two-phase locking protocol ensures serializability.
Illustrate how conflict serializability is checked using precedence graph with
the help of an example.
What is wrong with the following concurrent schedule? What is the
solution?
11 issues read lock on لا and reads رلا T2 issues read lock > and reads X, T1 issues
write lock on X, T2 issues write lock on Y.
Write explanatory notes on the following:
i) GIS ii) Big Data
How does RDF support semantic web technology?
க்
Page 4 of 4
ടെ. ~ ಇದ್ದು
(2 ४> ம
ہت ~~ ~~
(10)