Database Management System Practice Test 7

1. Conjunctive selection using one index. This is

2. The complexity of Bubble sort algorithm is

3. In _______________ index instead of storing all the columns for a record together, each column is stored separately with all other rows in an index.

4. Which is a join condition contains an equality operator:

5. If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is :

6. Which of the following scenarios leads to linear running time for a random search hit in a linear-probing hash table?

7. A technique for direct search is

8. In query processing, the ___________ is the lowest-level operator to access data.

9. The space factor when determining the efficiency of an algorithm is measured by

10. In a _____________ operations do not wait for requests to produce tuples, but instead generate the tuples eagerly.