A financial institution needs to store highly structured customer account information, including account numbers, balances, transaction history, and personal details. It is critical that data consistency is maintained across all transactions, ensuring that money is never lost or duplicated during transfers. The system must support complex queries involving joins across multiple tables and enforce referential integrity. Which database type is BEST suited for this requirement?
- ARelational Database
- BGraph Database
- CDocument Database
- DKey-Value Store
Show answer & explanationAnswer & explanation
Correct answer: A. Relational Database
Relational databases are the best choice for this scenario due to their inherent ability to handle 'highly structured' data, enforce 'data consistency' (ACID properties), support 'complex queries involving joins', and maintain 'referential integrity' through foreign keys. These features are critical for financial applications where data accuracy and transactional reliability are paramount.
Why the other options are wrong
- B. Graph databases are for modeling relationships but are not typically designed for the rigid structure, transactional consistency, and referential integrity required for core financial account management.
- C. Document databases offer schema flexibility but do not natively enforce the same level of transactional consistency or referential integrity as relational databases.
- D. Key-value stores are too simplistic for complex, structured financial data requiring joins and strong consistency.
Relational Database
A database that stores and provides access to data points that are related to one another. It's based on the relational model, organizing data into tables with predefined schemas and enforcing relationships via foreign keys.
- Data organized into tables (relations) with rows and columns.
- Enforces strict schemas and data integrity (e.g., foreign keys).
- Supports ACID properties (Atomicity, Consistency, Isolation, Durability).
- Uses SQL for querying and manipulation.
Memory trick: Relational is rigid, document is flexible, key-value is simple, graph is connected.