flâneur — a map of the web's best reading

Idempotency and Durable Execution | Temporal Technologies

temporal.io · 3,144 words · saved by 1 readers

Have you ever been working on a feature, or fixing a bug, and when you got to the bottom of it, duplicate records were being created in a database, or duplicate charges or orders were sent out? If so, idempotency is an important topic for you. Idempotency is a property of functions or operations in programming, and it’s a crucial property when working with durable execution systems such as Temporal. In this post, we’ll explain what it means to be idempotent and how idempotency can make your software systems easier to work with. We’ll show examples and get into some complex cases that can be managed with Temporal. It’s a fact of life that no system is perfectly reliable, and when things fail, we need to retry what we were doing. Wouldn’t it be nice if we could retry safely without causing unintended duplicate effects? Idempotency is what lets us do this! Idempotency is defined as a request that produces the same result, regardless of how many times it is made. If an idempotent request i

Life without idempotency # Have you ever been working on a feature, or fixing a bug, and when you got to the bottom of it, duplicate records were being created in a database, or duplicate charges or orders were sent out? If so, idempotency is an important topic for you. Idempotency is a property of functions or operations in programming, and it’s a crucial property when working with durable execution systems such as Temporal. In this post, we’ll explain what it means to be idempotent and how idempotency can make your software systems easier to work with. We’ll show examples and get into some c

Explore this link on the map →

related reading