Notes based on Adrian Cantrill's course from cantrill.io and Stéphane Maarek's Udemy course.
1 * 4KB
read operation per second for strongly consistent reads, 2 * 4KB
read operations per second for eventual consistent reads1 * 1KB
write operation per second ROUND UP(ITEM SIZE / 1 KB) => 3
MULT by average (30) => WCU required = 30
ROUND UP (ITEM SIZE / 4 KB) => 1
MULT by average read ops per second (10) => Strongly consistent reads = 10, Eventually consistent reads => 5
ALL
, KEYS_ONLY
, INCLUDE
(we can specifically pick which attribute to be included)ALL
, KEYS_ONLY
, INCLUDE
KEYS_ONLY
: the stream will only record the partition key and available sort keys for items which did changeNEW_IMAGE
: stores the entire item with the new state after the changeOLD_IMAGE
: stores the entire state of the item before the changeNEW_AND_OLD_IMAGE
: stores the before/after states of the items in case of a changeBatch
)GetItem
calls