刷題學習打卡 T-15

3/11  Designing Data-Intensive Applications: chp7 wip

3/12  Designing Data-Intensive Applications: chp7 wip

3/17 Designing Data-Intensive Applications: Done, Keyword: transactions, read committed, snapshot isolation/repeatable read, serializable; race conditions: dirty reads, dirty writes, read skew(snapshot isolation with MVCC, multi-version concurrency control), lost updates(manual lock: SELECT FOR UPDATE), write skew, phantom reads (index range locks);weak isolation,  two phrase locking, serialization snapshot isolation

3/16
Reading:

LC
992. Subarrays with K Different Integers

3/18:
Reading:
Designing Data-Intensive Applications, ch8 wip

LC:
128. Longest Consecutive Sequence

3/19:
Reading: Designing Data-Intensive Applications, ch8 done. Keyword, NTP un sync, dangerous to use system timestamp for Last write win strategy. ( time of the day clock vs monotonic clock), Google trueTime api with confidence interval
, the Byzantine Generals problem

3/23:
Leetcode # 1013. Pairs of Songs With Total Durations Divisible by 60

3/24:
ios: chp 10 done

3/25: Reading: Designing Data-Intensive Applications, ch9 wip

一起加油 我現在也每天刷題