17 a)

18

19

20

a)

$2088 Pages: 4

Give anon-canonical query tree for the expression Oa p(Clp<20(R*S)) on the
relations R(A,B,C,D) and S (D,E).

Consider the following tables representing enrolment of students to courses:
STUDENT (ROLLNO, NAME, AGE, ADDRESS, EMAIL), COURSE(CNO,
CNAME, AREA) and ENROLEMENT(ROLLNO, CNO,GRADE), where
ROLLNO and CNO in ENROLMENT re foreign keys referring to the primary
keys with the same names.

Show an initial query tree for the following query and optimize it using the rules of
heuristics. Assume that CNAME is a candidate key of COURSE.

SELECT CNAME, NAME, EMAIL, GRADEFROM STUDENT, COURSE,
ENROLMENTWHERE COURSE.CNO=ENROLMENT.CNO AND
STUDENT.ROLLNO = ENROLLMENT.ROLLNO AND COURSE.CNAME =
‘dbs’

Check if the following schedules are conflict-serializable using precedence graph.
If so, give the equivalent serial schedule(s). 73(X), r2(X), w3(X), ൧/0, wl (X).
(Note: ri(X)/wi(X) means transaction Ti issues read/write on item X.)

Discuss dirty-read and lost-update problems with the help of examples.

How 15 strict two-phaselocking different from standard two-phase locking
protocol?

With the help of suitable logs, show how recovery is done in deferred database
modification scheme.

What is the significance of check-pointing?

Give a simple RDF document and show the corresponding graph structure.

Write an explanatory note on Big Data.

Highlight any three salient features of GIS.

ಸೇ ಸೇ ಸೇ ‏اد‎

Page 4 of 4

(2)

(10)

(4)

(6)
(2)

(5)

(3)
(3)
(4)
(3)