Consider the following kd-tree index on table (Age,Salary). Suppose a search query uses this index to find the records with age=55. How many leaf nodes will be returned as a query result? Your answer is of type integer, like 6521.   

Consider the following grid index with 3x3=9  entry buckets on table R(Age,Salary). Suppose we insert the records (22, 220), (44, 330), and (91, 91), and maintain the grid structure afte each insertion. How many buckets will the grid have at the end?    

We want to build a bit-map index for a table R(A,B) that has 10 records. Suppose the domain of attribute A is {a1,a2,a3,a4} and the domain of B is {b1,b2,b3}.   How many bits are needed for the bitmap indexes on attributes A and B? Your answer will be an integer type, for example 6521.

Consider a table R(A,B)  that has 10 records: 1,2,...,10. Suppose the compressed bitmap vector for a value x of attribute A is 1010110100. For which of the following list of records of R the condition A=x is true? 

In the following variant of a B+ tree with n=4,  suppose we delete the record with key 24. What is the best we can say about the resulting tree?

For a B+ tree index of order n=4, what are the minimum and maximum number of key values in the root?  

True/False: Consider the following is a variant of a B+ tree with parameter n=4 which is slightly different from what we considered in class in that a pointer to the right of a key x includes records with keys x. Suppose we delete the record with key 27. Then we merge the leaf nodes with keys {29} and {22, 24} into a single leaf node.

In the following variant of a B+ tree with n=4,  suppose we insert a record with key 37. Which of the following leaf nodes will we have in the resulting tree?

A static hash table with 10 buckets uses the hash function mod , where is a key value. Suppose each block can fit 2 records and that each bucket holds 1 block. If we hash 20 records, which of the following are CORRECT about possible minimum and maximum number of OVERFLOW buckets used?