Semester : SEMESTER 1
Subject : Topics in Database Technology
Year : 2015
Term : DECEMBER
Branch : COMPUTER SCIENCE AND ENGINEERING
Scheme : 2015 Full Time
Course Code : 01 CS 6103
Page:1
1
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
FIRST SEMESTER M.TECH DEGREE EXAMINATION,
DECEMBER 201 5
Department: Computer Science and Engineering
Stream: Computer Science and Engineering
01056103: Topics in Database Technology
Answer any twofull questions from each part
Limit answers to the required points.
Max. Marks: 60 Duration: 3 hours
PART 1
.a. What is meant by pipelined query evaluaaon? How is it advantageous over (2) materialized
evaluation?
b. Consider the following tables represenang enrollment of students to courses: (6)
STUDENT (ROLLNO, NAME, AGE, ADDRESS, EMAIL),
COURSF(CNO, CNANAZ, AREA) and ENROLLEMENT(ROLLNO.
CNO.GRADE), where ROLLNO and CNO in ENROLLMENT are
foreign keys referring to the primary keys with the same names.
Show an 111881 query tree for the following query and optirnize it using the rules of
heurisiics:
SELECT CNP,ME, ೫೫೩೫, EteaAIL, GRADE
FROM STUDENT, COURSE, ENROLLMENT WHERE
COURSE. CNO=ENROLLMENT ∙ CNO and
STUDENT . ROLLNO ENROLLMENT . ROLLNO
and COURSE . CNAME = dbs' and STUDENT
-NAME = Raj ذا '
Assume that CNAME is a candidate key of COURSE.
c. Suppose that a certain job was executing on single processor system in 2 hours. (2) Now that
the size of the job has been doubled, it is shiftedto a two-processor machine. If it is observed
that tile new job takes 3.5 hours to run, compute the speed-up achieved. Is the speed-up
linear or sub-linear? VVhy?