Question 498 of 509
Mining and Acquiring DatamediumMultiple ChoiceObjective-mapped

Quick Answer

The answer is fuzzy matching on name and address. This technique is the most effective for merging customer databases from different acquisitions because it accounts for variations in spelling, formatting, and abbreviations—such as “Bob” versus “Robert” or “St.” versus “Street”—that exact matching would miss. Fuzzy matching uses algorithms like Levenshtein distance or Jaro-Winkler to quantify similarity, enabling the identification of near-matches and ensuring comprehensive deduplication. On the CompTIA Data+ DA0-001 exam, this question tests your understanding of data profiling techniques for real-world data quality challenges; a common trap is choosing exact matching, which fails with inconsistent data. Remember the memory tip: “Fuzzy finds the family, exact loses the cousin”—fuzzy matching catches the variations that exact matching overlooks.

DA0-001 Mining and Acquiring Data Practice Question

This DA0-001 practice question tests your understanding of mining and acquiring data. Read the scenario carefully and evaluate each option against the stated constraints before committing to an answer. After answering, compare your reasoning against the explanation and wrong-answer breakdown below. Once you have made your selection, read the full explanation to reinforce the concept and understand why each distractor is designed to mislead on exam day.

A company is merging two customer databases from different acquisitions. They need to identify duplicate records. Which data profiling technique is most effective?

Question 1mediummultiple choice
Full question →

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

Fuzzy matching on name and address

Fuzzy matching on name and address is the most effective technique because customer databases from different acquisitions often contain variations in spelling, formatting, and abbreviations (e.g., 'Bob' vs. 'Robert', 'St.' vs. 'Street'). Exact matching would miss these duplicates, while fuzzy matching uses algorithms like Levenshtein distance or Jaro-Winkler to quantify similarity and identify near-matches, ensuring comprehensive deduplication.

Key principle: Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option.

Answer analysis

Option-by-option breakdown

For each option: why learners choose it and why it is or isn't the right answer here.

  • Fuzzy matching on name and address

    Why this is correct

    Fuzzy matching handles variations and is appropriate for deduplication.

    Related concept

    Read the scenario before looking for a memorised answer.

  • Manually compare all records

    Why it's wrong here

    Manual review is time-consuming and error-prone for large datasets.

  • Exact match on customer names

    Why it's wrong here

    Exact match misses duplicates with minor name differences.

  • Use primary keys from each database

    Why it's wrong here

    Primary keys are system-specific and won't match across databases.

Common exam traps

Common exam trap: answer the scenario, not the keyword

The trap here is that candidates assume exact matching or primary keys are sufficient for deduplication, overlooking the real-world data inconsistencies that fuzzy matching is designed to handle.

Detailed technical explanation

How to think about this question

Fuzzy matching typically relies on string similarity metrics such as Levenshtein distance (edit distance) or the Jaro-Winkler algorithm, which adjusts for common prefix matches. In real-world scenarios, combining multiple fields (e.g., name, address, phone) with weighted scoring reduces false positives, and blocking techniques (e.g., sorting by zip code) improve performance by limiting comparisons to candidate pairs.

KKey Concepts to Remember

  • Read the scenario before looking for a memorised answer.
  • Find the constraint that changes the correct option.
  • Eliminate answers that are true in general but not in this case.

TExam Day Tips

  • Watch for words such as best, first, most likely and least administrative effort.
  • Review why wrong options are wrong, not only why the correct option is correct.

Key takeaway

Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option.

Real-world example

How this comes up in practice

A practitioner preparing for the DA0-001 exam encounters this exact type of scenario on the job. The correct answer here is not the most general option — it is the best answer for the specific constraint described. Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option. Real exam questions reward reading the full scenario before eliminating options, because the constraint defines which answer fits.

What to study next

Got this wrong? Here's your next step.

Identify which exam domain this question belongs to, review the core concept, then practise similar questions from the same domain.

Related practice questions

Related DA0-001 practice-question pages

Use these pages to review the topic behind this question. This is how one missed question becomes focused revision.

Practice this exam

Start a free DA0-001 practice session

Short sessions build daily habit. Longer sessions build exam-day stamina. Try a timed session to simulate real conditions.

FAQ

Questions learners often ask

What does this DA0-001 question test?

Mining and Acquiring Data — This question tests Mining and Acquiring Data — Read the scenario before looking for a memorised answer..

What is the correct answer to this question?

The correct answer is: Fuzzy matching on name and address — Fuzzy matching on name and address is the most effective technique because customer databases from different acquisitions often contain variations in spelling, formatting, and abbreviations (e.g., 'Bob' vs. 'Robert', 'St.' vs. 'Street'). Exact matching would miss these duplicates, while fuzzy matching uses algorithms like Levenshtein distance or Jaro-Winkler to quantify similarity and identify near-matches, ensuring comprehensive deduplication.

What should I do if I get this DA0-001 question wrong?

Identify which exam domain this question belongs to, review the core concept, then practise similar questions from the same domain.

What is the key concept behind this question?

Read the scenario before looking for a memorised answer.

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 →

How Courseiva writes practice questions · Editorial policy

Keep practising

More DA0-001 practice questions

Last reviewed: Jun 24, 2026

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.

Loading comments…

Sign in to join the discussion.

This DA0-001 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 DA0-001 exam.