Dynamo DB
Everything on SkillVeris tagged Dynamo DB — collected across the glossary, study notes, blog, and cheat sheets.
13 resources across 3 libraries
Study Notes(1)
Cheat Sheets(1)
Interview Questions(11)
What is a Key-Value Store and When Should You Use One?
A key-value store is the simplest NoSQL model: every item is an opaque value retrieved by a unique key, with no required schema and no built-in support for que…
How Do You Design a Good Partition Key in DynamoDB?
A good DynamoDB partition key spreads items as evenly as possible across the table's underlying partitions by having high cardinality and uniform access freque…
What is a Global Secondary Index (GSI) in DynamoDB?
A Global Secondary Index (GSI) in DynamoDB is an alternate partition-and-sort-key view of a table that lets you query items efficiently by attributes other tha…
What is the CAP Theorem and What Trade-offs Does It Force?
The CAP theorem states that a distributed data store can provide at most two of Consistency, Availability, and Partition tolerance at the same time, and since…
What is the PACELC Theorem and How Does It Extend CAP?
PACELC extends the CAP theorem by pointing out that even when there is no network partition, a distributed system still has to trade off Latency against Consis…
Strong Consistency vs Eventual Consistency: How Do You Choose?
Strong consistency guarantees that every read returns the most recently written value across all replicas, typically by requiring writes and reads to coordinat…
What is Quorum-based Consensus and How Does It Work?
Quorum-based consensus requires a minimum number of nodes (a quorum) to agree before a read or write is considered successful, typically enforcing that the rea…
What are Vector Clocks and Why Are They Used?
A vector clock is a data structure — one counter per node — that a distributed system attaches to events so it can determine whether one event causally happene…
What is the Hot Partition Problem and How Do You Fix It?
The hot partition problem occurs when a partitioning scheme sends a disproportionate share of traffic to one shard — because the chosen partition key is skewed…
How Do You Design a Good Partition Key?
A good partition key spreads data and traffic evenly across all partitions (avoiding hot spots) while still keeping any data that must be read or ordered toget…
How Are Merkle Trees Used in Distributed Systems?
A Merkle tree is a binary tree of hashes where every leaf holds the hash of a data block and every parent holds the hash of its children’s combined hashes, let…