A relation schema R that meets Generalized 3NF criteria may have transitive dependencies

Match the following HTTP methods with their purpose:

Pick the TRUE statement, with respect to creating an index on a column:

Given R(A, B, C) with state: A B C a f m a g m b h m b i n c j n c k n The functional dependency A → B holds for the database state shown. (true or false) .

Given R(A, B, C) with state: A B C a f m a g m b h m b i n c j n c k n The functional dependency B → A holds for the database state shown. (true or false)

Given R(A, B, C) with state: A B C a f m a g m b h m b i n c j n c k n The functional dependency B → C holds for the database state shown. (true or false)

Given R(A, B, C) with state: A B C a f m a g m b h m b i n c j n c k n The functional dependency C → B holds for the database state shown. (true or false)

What is the best choice for an index for the following query: select name, fav_color from employee where fav_color=’blue’;

What is the best choice for an index for the following query: select name, birthday from employee where birthday > ‘1992-01-10’;

What makes BTree a good choice for an index (choose best statement)