Database Management System (DBMS) Questions - Indexing Unsorted Data

1. Secondary indexes require the data file to be sorted on the search field. (True or False)

2. A file can be a hashed file and have a B+tree index as well. (True or False)

3. A file can have both a primary index and a secondary index. (True or False)

4. A B+tree can be used for sorted or unsorted data. (True or False)

5. A secondary index is always a sparse index. (True or False)

6. One of the disadvantages of B+ trees is that they require reorganization of the data file when a new record is inserted. (True or False)

7. For a secondary index where the data is unsorted and has duplicate values, the number of index entries is equal to:

the number of records in the data file

the number of blocks in in the data file

the number of unique values

all of the above

8. For a secondary index where the data is unsorted and the values are unique (each one occurs only once), the number of index entries is:

the number of blocks in the data file

the number of records in the data file

log base 2 of the number of records in the file

log base 2 of the number of blocks in the file