KEY–VALUE DATABASES — Learn free

Self-check

Questions 1–10 of 10

1. How does a key–value database store data?
Question 1A. As a pair consisting of a unique key and its associated valueB. As rows with dynamic columns grouped into familiesC. As nodes and edgesD. As nested JSON documents queried by fieldE. As immutable events in a chronological log
2. What is the primary goal of key–value databases?
Question 2A. Supporting complex joins across entitiesB. Delivering ultra-fast lookups with minimal overheadC. Enforcing relational integrity constraintsD. Enabling semantic reasoning over relationshipsE. Providing rich ad-hoc analytical queries
3. Which forms can the value in a key–value database take?
Question 3A. Only fixed-length stringsB. Only numeric typesC. A simple string, a JSON object or even a binary blobD. Only references to other keysE. Only relational rows
4. Which workloads are named as typical uses for key–value databases?
Question 4A. Regulatory reporting and cross-portfolio analyticsB. Fraud-ring detection and multi-hop traversalC. Enterprise data warehousingD. Caching, session management, token storage and high-volume read/write operationsE. Schema validation for partner integrations
5. In the loan approval example using Redis, what is used as the key and what does the value contain?
Question 5A. CustomerID as the key and a list of repayment dates as the valueB. OfficerID as the key and a branch name as the valueC. A composite of LoanID and RepayDate as the key and an amount as the valueD. Status as the key and a list of loans as the valueE. LoanID as the key and a JSON structure with LoanAmount, InterestRate, Status, CustomerID and OfficerID as the value
6. What response time is typical when a loan record is retrieved from a key–value cache in a single lookup?
Question 6A. Sub-millisecond latencyB. Several secondsC. Around one minuteD. Batch-level latency of hoursE. The same latency as a multi-table relational join
7. Which of the following is NOT listed as a strength of key–value databases?
Question 7A. Extremely fast read and write performanceB. Support for ad-hoc queries beyond key retrievalC. Simplicity of design and operationD. Easy horizontal scalingE. Suitability for caching layers in distributed architectures
8. How are key–value databases best understood within an enterprise architecture?
Question 8A. As the primary system of record for financial transactionsB. As replacements for relational databasesC. As performance accelerators that complement relational or document databasesD. As analytical engines for reportingE. As the backbone for knowledge graphs
9. In the comparison of relational and key–value models for loan approval, what is the key difference?
Question 9A. The relational model needs no joins while the key–value model needs manyB. The key–value model is normalised while the relational model is denormalisedC. The relational model is used only for cachingD. The relational model is structured and normalised with complex queries and joins, whereas the key–value model gives ultra-fast lookups with limited queryingE. Both models offer identical query flexibility
10. Why is the key–value model described as the purest form of workload-driven data modelling?
Question 10A. Because it enforces the strictest schema of any NoSQL familyB. Because it supports every type of queryC. Because it is grounded in relational algebraD. Because it stores relationships as first-class elementsE. Because it is optimised for simplicity and performance above all else