DA0-002 Data Concepts and Environments Practice Question
A financial institution wants to analyze transaction networks to detect fraud rings. Which database type is best suited for this analysis?
⚠ Common exam trap
CompTIA often tests the misconception that any NoSQL database can handle relationship-heavy workloads, but the trap here is that only graph databases are purpose-built for deep relationship traversal and pattern matching, while other NoSQL types sacrifice relationship performance for scalability or flexibility.
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
✓
Graph database
A graph database is designed to store and traverse relationships between entities, making it ideal for analyzing transaction networks where connections between accounts, merchants, and transactions reveal fraud rings. Its native graph model (nodes and edges) allows efficient pattern matching and pathfinding queries, such as detecting circular transactions or shared attributes, which are common in fraud detection.
Answer analysis
Option-by-option breakdown
For each option: why learners choose it and why it is or isn't the right answer here.
- ✗
Wide-column store
Why it's wrong here
Wide-column stores optimise sparse, high-volume writes keyed by row and column, not traversal of relationships between entities. It tempts because they scale to enormous datasets, but fraud-ring detection needs multi-hop relationship queries, which a graph database handles natively.
- ✓
Graph database
Why this is correct
Graph databases store entities as nodes and relationships as edges, so traversing transaction links between accounts is a native pointer hop rather than an expensive join. This directly satisfies the fraud-ring detection requirement, where identifying circular money flows depends on multi-hop relationship traversal.
- ✗
Key-value store
Why it's wrong here
Key-value stores resolve a single key to an opaque value with no queryable relationships between records. It tempts because they offer very fast lookups at scale, but fraud-ring detection needs multi-hop traversal across linked entities, which a graph database provides.
- ✗
Document store
Why it's wrong here
Document stores retrieve self-contained JSON-like records by field or index; they cannot traverse links between accounts efficiently. It tempts because documents can embed related entities, but fraud-ring detection requires arbitrary-depth relationship queries, which a graph database performs natively.
Go deeper
Related to this question
About these practice questions
This DA0-002 question is part of Courseiva's 1,004-question bank — original exam-style content with full explanations and wrong-answer analysis, never real exam questions or exam dumps. Learn why practice questions differ from exam dumps →
JA
Written by Johnson Ajibi, MSc IT Security
Senior Network & Security Engineer · founder of Courseiva
This DA0-002 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-002 exam.