E B4E561 Pages: 4

18. ൭. Show the generic structure of a B+-Tree clearly indicating the types keys and pointers (5) and their
significance.
b. What is the significance of check-pointing? Illustrate with a typical example. (5)
19.a. Illustrate lost-update and dirty-read problems with suitable examples. (4) b. Determine if the
following schedule is serializable. (6)

r1(X), r2(Z), r1(Z), r3(X), 13(Y), w1(X), w3(Y), r2(Y), w2(Z), w2(Y) (Note:
ri(X)/wi(X) means transaction Ti issues read/write on item 20

20.a. Write a small RDF document and show its equivalent graph structure. (4) b. List out any
three salient features of Big data. (3)

c. How is GIS databases different from conventional databases? (3)

Page 4 of 4