CDMP-RMD practice question 21 of 35

Which of the following is NOT ,1 characteristic of n deterministic matching algorithm?

Full set: 100 questions
Answer options
A: Is better suited when there is no great consequence to an error in matching
B: Is not highly dependent on the quality of the data being matched Correct answer
C: Has a discrete all or nothing outcome
D: Matches exact character to character of one or more fields
E: All identifiers being matched have equal weight
Correct Answer:
B. Is not highly dependent on the quality of the data being matched
Explanation

Deterministic matching algorithms operate on predefined, exact rules, such as requiring a character-for-character match on a specific identifier (e.g., Social Security Number). Because of this exactness, their success is fundamentally and highly dependent on the quality of the underlying data. Any data quality issues, including misspellings, formatting inconsistencies, typos, or missing values, will cause a deterministic match to fail. Therefore, the statement that it is not highly dependent on data quality is false and is NOT a characteristic of this method.

Why Incorrect

A. Is better suited when there is no great consequence to an error in matching This is incorrect. Deterministic matching provides high precision and minimizes false positives, making it best suited for situations where the consequence of an incorrect match (a false positive) is high.
C. Has a discrete all or nothing outcome This is a defining characteristic. A record pair either meets the exact matching rule and is declared a match, or it does not. There are no intermediate scores or probabilities.
D. Matches exact character to character of one or more fields This is the definition of deterministic matching. It relies on the exact agreement of values within the specified matching fields.
E. All identifiers being matched have equal weight This is a characteristic of the rule-based approach. In a rule like "match if First Name, Last Name, and DOB are identical," all three fields are required and thus have equal, absolute importance. ---

References

1. DAMA International. (2017). DAMA-DMBOK: Data Management Body of Knowledge (2nd ed.).

Page 438, Chapter 13, Section 3.3.2 Matching: "Deterministic (or exact) matching requires that records have an exact match on a set of attributes... This method is highly dependent on data quality; if data is not standardized, the match will fail." This directly refutes option B, establishing it as the correct answer. The text also confirms that the outcome is a simple match/no-match (supporting C) and is based on exact attribute agreement (supporting D).

2. Herzog, T. N., Scheuren, F. J., & Winkler, W. E. (2007). Data Quality and Record Linkage Techniques. Springer.

Page 69, Chapter 5, Deterministic Record Linkage: "In deterministic record linkage, a record pair from two files is designated as a match if the set of identifiers for the two records agree exactly... If any component of the matching key disagrees, then the pair is considered a nonmatch." This passage underscores the all-or-nothing outcome (C), the exact matching principle (D), and the inherent, high dependency on data quality (refuting B).

3. Christen, P. (2012). Data Matching: Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection. Springer.

Page 29, Section 2.3.1, Deterministic Matching: "The main limitation of deterministic matching is its low robustness against data errors. A single error in a matching key value will result in a non-match of two records that do refer to the same entity." This academic source explicitly states that a core limitation (and therefore a characteristic) is its sensitivity to data errors, directly contradicting option B.

Scroll to Top