Home »
MCQs »
DBMS MCQs »
DBMS Hashing MCQs
When a database structure has a huge number of index values, it is very ___ to search all of them for the desired information
1. When a database structure has a huge number of index values, it is very ___ to search all of them for the desired information.
- Sufficient
- Efficient
- Inefficient
- None
Answer: C) Inefficient
Explanation:
When a database structure has a huge number of index values, it is very inefficient to search all of them for the desired information.