---
title: "BotanicalCoder (@BotanicalCoder) | Hashnode"
description: "Web Developer. Read the latest articles by BotanicalCoder on Hashnode."
url: "https://hashnode.com/@BotanicalCoder"
---

@BotanicalCoder

# BotanicalCoder

@BotanicalCoder · Joined January 2021

Web Developer

[Website](https://botanicalcoder.netlify.app/)

### [Read-After-Write Consistency](https://botanicalcodersblog.hashnode.dev/read-after-write-consistency?utm_source=hashnode&utm_medium=feed)

Read-After-Write (RAW) consistency, also called Read-Your-Writes consistency, means that after a user or client successfully writes data, an immediate read will return that new data or a newer version

5 min read · [botanicalcodersblog.hashnode.dev](https://botanicalcodersblog.hashnode.dev/read-after-write-consistency?utm_source=hashnode&utm_medium=feed)

[Oct 4](https://hashnode.com/posts/read-after-write-consistency/6ac29f87a061d3a0e1feb5dc)

### [Database Deadlocks: When Transactions Get Stuck Waiting for Each Other](https://botanicalcodersblog.hashnode.dev/database-deadlocks-when-transactions-get-stuck-waiting-for-each-other?utm_source=hashnode&utm_medium=feed)

A database deadlock happens when multiple transactions are waiting for each other in a way that means none of them can continue. Each transaction may be perfectly valid on its own. The problem comes f

8 min read · [botanicalcodersblog.hashnode.dev](https://botanicalcodersblog.hashnode.dev/database-deadlocks-when-transactions-get-stuck-waiting-for-each-other?utm_source=hashnode&utm_medium=feed)

[Oct 4](https://hashnode.com/posts/database-deadlocks-when-transactions-get-stuck-waiting-for-each-other/6ac28838de0e5c6b4e567902)

### [Idempotency Is Not the Same as Concurrency Control](https://botanicalcodersblog.hashnode.dev/idempotency-is-not-the-same-as-concurrency-control?utm_source=hashnode&utm_medium=feed)

Idempotency and concurrency control are distinct backend design guarantees that solve two fundamentally different failure modes in distributed systems. Idempotency ensures that executing the same logi

9 min read · [botanicalcodersblog.hashnode.dev](https://botanicalcodersblog.hashnode.dev/idempotency-is-not-the-same-as-concurrency-control?utm_source=hashnode&utm_medium=feed)

[Oct 4](https://hashnode.com/posts/idempotency-is-not-the-same-as-concurrency-control/6ac22ae0ad5b01458bf058d4)

### [Time of Check to Time of Use (TOCTOU)](https://botanicalcodersblog.hashnode.dev/time-of-check-to-time-of-use-toctou?utm_source=hashnode&utm_medium=feed)

The pattern: if (balance >= amount) debit() can fail under concurrency because the check and the subsequent debit are separate operations rather than one atomic check-and-act operation. It splits a s

7 min read · [botanicalcodersblog.hashnode.dev](https://botanicalcodersblog.hashnode.dev/time-of-check-to-time-of-use-toctou?utm_source=hashnode&utm_medium=feed)

[Sep 29](https://hashnode.com/posts/time-of-check-to-time-of-use-toctou/6abb7b62766883c570bf7777)

### [Locks, MVCC, Isolation Levels, Atomic Updates, Optimistic and Pessimistic Concurrency; the major tools databases use to control concurrent operations.](https://botanicalcodersblog.hashnode.dev/locks-mvcc-isolation-levels-atomic-updates-optimistic-and-pessimistic-concurrency-the-major-tools-databases-use-to-control-concurrent-operations?utm_source=hashnode&utm_medium=feed)

Managing concurrent operations safely while maintaining performance is a central challenge of database engine design. Database engines achieve this using several core primitives and concurrency contro

9 min read · [botanicalcodersblog.hashnode.dev](https://botanicalcodersblog.hashnode.dev/locks-mvcc-isolation-levels-atomic-updates-optimistic-and-pessimistic-concurrency-the-major-tools-databases-use-to-control-concurrent-operations?utm_source=hashnode&utm_medium=feed)

[Sep 28](https://hashnode.com/posts/locks-mvcc-isolation-levels-atomic-updates-optimistic-and-pessimistic-concurrency-the-major-tools-databases-use-to-control-concurrent-operations/6ab9f30f24f1b5eec3ab8318)
