b. Suppose that the data records are partitioned across 4 processors PO, PI, ...,P3in
(6) share-nothing system as follows:

Disk record keys
15, 7, 0, 9. 4
Do | 24, 16, 3, 7. 13
27, 14, 19, 5, 22
18, 2, 8, 25, 16

Compute the total communication cost involved when the data is sorted using, .
i. Parallel External Sort-Merge
ii. Parallel Sort

Assume that partition vector [7, 16, and 21] is used and that each processor can apply
external-sorting independently.

Note: - Communication cost is measured as the number ofvalues movingfrom one processor to
another.

c. Briefly explain how time is represented in temporal databases. (3)

6. ೩. Consider the following relations: (7)

EMPLOYEE(ENO NANfE, ADDRESS, DOB,AGE, SALARY, DNUM)

DEPARTMENT(QNO DNAME, DLOCATION, DPHONE,
MGRENO)

DNUM is a foreign key that identifies the department to which an employee
belongs. Assume that every employee belongs to exactly one department and that
DNAME is a candidate key.The following is the statisHcs about relations.
EMPLOYEE is at site 1 and has 10,000 records each of size 100 bytes;
DEPARTMENT is at site 2 and has 20 records each of size 70 bytes. ENO,
ENAME, DNUM, DNO, DNAME are of size 4, 7, 3, 3 and 10 bytes, respectively.
Identify the best s&ategy execute the following query issued at site 1, by
compua_ng the communication cost involved.

SELECT ENANE, DNAME
FROM EMPLOYEE, DEPARTMENT
WHERE DNUM = DNO and ='CSE’
b. Write a note on k-d trees. (3)

PART 111

7.a. Suppose that we have to create table of students where each student is represented (5) as an
object of type s_type. This type contains the following fields: person of somepreviously
defined type p_type (with fieldsname of type string and age of typeinteger), rollno of
type integer, email-id of type string and year_of_graduation of type integer. Write
declarative statements in INFORMIXto create the type s_type and the corresponding
table.