COMP9315 Final Exam |
The University of New South Wales COMP9315 DBMS Implementation Final Exam |
DBMS Implementation |
Consider the following tuple space for a relation T(A,B) which has been indexed/partitioned by a quad-tree.
How many nodes are in the quad-tree?
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?
How many tuples (appearing as x's on the diagram) would be in the result set?
Show all working.
Instructions: