COMP9315 Final Exam The University of New South Wales
COMP9315 DBMS Implementation
Final Exam
DBMS Implementation
[Instructions] [Notes] [PostgreSQL] [C]
[Q1] [Q2] [Q3] [Q4] [Q5] [Q6] [Q7] [Q8]

Question 6 (3 marks)

Consider the following tuple space for a relation T(A,B) which has been indexed/partitioned by a quad-tree.

  1. How many nodes are in the quad-tree?

  2. If we ask the query select * from R where A > 40 and B < 'f', then which quadrants (and sub-quadrants and ...) would need to be examined?

  3. How many tuples (appearing as x's on the diagram) would be in the result set?

Show all working.

Instructions:

End of Question