COMP9315 Final Exam |
The University of New South Wales COMP9315 DBMS Implementation Final Exam |
DBMS Implementation |
Consider a table R(a,b,c,d) indexed by tuple-based superimposed codeword signatures. The data and signature files have the following properties:
Page Size | 4096 bytes |
Number of records (rR) | 10000 |
Record size (RR) | 32 bytes |
Signature size (m) | 58 bits |
Bits/attribute (k) | 10 bits |
False match probability (pF) | 1 in 1000 |
You can make the following (slightly unrealistic) assumptions:
Based on the above, answer the following:
How many pages are there in the data file?
How many pages are there in the signature file?
How many pages are read in answering the query R(?,b,c,d)?
(include both signature pages and data pages, as needed)
How many pages are read in answering the query
(include both signature pages and data pages, as needed)
What feature of the query signature would allow you to optimise the page reads for R(?,?,?,?)?
What would be the values of m and k if we decided to use page-level signatures, rather than tuple-level signatures?
Show all working.
Instructions: