Question 279 of 988
mediumMultiple ChoiceObjective-mapped
FC0-U71 Practice Question: A database administrator is troubleshooting a…
A database administrator is troubleshooting a slow query on a large table. Which index type would improve performance for an exact match search on a single column?
⚠ Common exam trap
Candidates often confuse clustered indexes with performance gains for all query types, not realizing that a clustered index primarily optimizes data retrieval order and can slow down writes, while a B-tree index is the standard choice for exact match searches in most relational databases.
Answer choices
Why each option matters
Answer the question above first, then reveal the full breakdown to understand why each option is right or wrong.
Correct answer & explanation
✓
B-tree index
A B-tree index is the correct choice for an exact match search on a single column because it organizes data in a balanced tree structure that allows O(log n) lookups, making it highly efficient for equality searches. In a large table, the B-tree index reduces the number of disk I/O operations by quickly navigating to the leaf node containing the exact key value.
Answer analysis
Option-by-option breakdown
For each option: why learners choose it and why it is or isn't the right answer here.
- ✗
Clustered index
Why it's wrong here
Clustered indexes sort and store data physically, which may not always improve performance for exact matches.
- ✓
B-tree index
Why this is correct
B-tree indexes are ideal for exact match and range queries, providing fast lookup.
- ✗
Bitmap index
Why it's wrong here
Bitmap indexes are efficient for columns with few distinct values, not for high-cardinality columns.
- ✗
Hash index
Why it's wrong here
Hash indexes are fast for exact matches but do not support range queries.
About these practice questions
Courseiva creates original exam-style practice questions with explanations and wrong-answer analysis. It does not publish real exam questions, exam dumps, or protected exam content. Learn why practice questions differ from exam dumps →
Same concept, more angles
1 more way this is tested on FC0-U71
These questions test the same concept from different angles. Work through them to make sure you can recognise it however the exam phrases it.
Variation 1. A database administrator notices that queries on a large table are taking too long to execute. Which action would most likely improve performance?
medium- A.Add more columns to the table.
- B.Denormalize the table.
- C.Perform further normalization.
- ✓ D.Create an index on frequently queried columns.
Why D: Creating an index on frequently queried columns allows the database to locate rows using a B-tree or hash structure, reducing the need for full table scans. This directly addresses slow query performance on large tables by minimizing disk I/O and CPU overhead during SELECT operations.
Last reviewed: Jun 11, 2026
This FC0-U71 practice question is part of Courseiva's free CompTIA certification practice question bank. Courseiva provides original exam-style practice questions with explanations, topic-based practice, mock exams, readiness tracking, and study analytics to help learners prepare for the FC0-U71 exam.
Question Discussion
Share a tip, memory trick, or ask about the reasoning behind this question. Do not post real exam questions, leaked content, braindumps, or copyrighted exam material. Comments are moderated and may be removed without notice.
Sign in to join the discussion.