Tagged articles

Optimistic Lock

122 articles · Page 2 of 2

Dec 22, 2018 · Backend Development

Understanding Idempotency: Concepts, Examples, and Implementation Techniques

This article explains the mathematical and programming concept of idempotency, provides real‑world examples such as duplicate form submissions and payment requests, and details practical techniques—including query/select operations, unique indexes, token mechanisms, pessimistic and optimistic locks, distributed locks, and API design—to ensure idempotent behavior in backend systems.

Optimistic LockPessimistic Lockdatabase

0 likes · 9 min read

Understanding Idempotency: Concepts, Examples, and Implementation Techniques

Java Captain

Nov 7, 2018 · Databases

Using Pessimistic and Optimistic Locks to Prevent Over‑Issuance in a Red‑Packet System

This article explains how to use pessimistic (FOR UPDATE) and optimistic (version field) database locks in a Java SSM red‑packet application to prevent over‑issuance, details implementation steps, code changes, performance testing, and the trade‑offs between lock types.

Database ConcurrencyJavaMyBatis

0 likes · 11 min read

Using Pessimistic and Optimistic Locks to Prevent Over‑Issuance in a Red‑Packet System

Java Captain

Sep 25, 2018 · Fundamentals

Optimistic vs Pessimistic Locks and CAS Implementation in Java

The article explains the concepts of pessimistic and optimistic locking, details how CAS (Compare‑And‑Swap) implements optimistic locks in Java, discusses their advantages, drawbacks such as the ABA problem and high spin costs, and compares CAS usage with synchronized blocks in concurrent programming.

CASJava concurrencyOptimistic Lock

0 likes · 14 min read

Optimistic vs Pessimistic Locks and CAS Implementation in Java

Mike Chen's Internet Architecture

Sep 15, 2018 · Databases

Overview of MySQL Locks: Types, Characteristics, and Usage Scenarios

This article explains MySQL's lock mechanisms, covering table‑level, row‑level, and page locks, the differences between pessimistic and optimistic locking, shared locks, and provides guidance on when to choose table locks versus row locks in various application scenarios.

Database ConcurrencyLocksMySQL

0 likes · 7 min read

Overview of MySQL Locks: Types, Characteristics, and Usage Scenarios

Architects' Tech Alliance

Sep 11, 2018 · Databases

Pessimistic vs Optimistic Locking: A Story-Based Explanation

This article uses a humorous story of two threads battling over inventory updates to illustrate the principles, advantages, and drawbacks of pessimistic and optimistic locking in distributed systems, helping readers understand when to apply each concurrency control method.

Optimistic LockPessimistic Lockconcurrency control

0 likes · 8 min read

Pessimistic vs Optimistic Locking: A Story-Based Explanation

360 Quality & Efficiency

Jul 6, 2018 · Backend Development

Understanding Idempotency and How to Ensure It in Backend Systems

The article explains the mathematical definition of idempotency, its importance in preventing duplicate operations such as repeated payments or order creation, and presents practical strategies—including unique business IDs, optimistic locking, deduplication tables, distributed locks, token mechanisms, and payment buffering—to achieve reliable idempotent behavior in backend services.

BackendOptimistic LockToken

0 likes · 6 min read

Understanding Idempotency and How to Ensure It in Backend Systems

Architecture Digest

May 14, 2018 · Backend Development

Implementing and Optimizing a High‑Concurrency Flash Sale System with Optimistic Lock, Distributed Rate Limiting, Redis Cache, and Kafka

This article walks through building a Java‑based flash‑sale (秒杀) service, diagnosing overselling issues, and progressively enhancing it with optimistic locking, distributed rate limiting, Redis caching, and asynchronous Kafka processing to achieve higher throughput and data consistency under heavy concurrency.

Distributed Rate LimitingFlash SaleJava

0 likes · 14 min read

Implementing and Optimizing a High‑Concurrency Flash Sale System with Optimistic Lock, Distributed Rate Limiting, Redis Cache, and Kafka

ITFLY8 Architecture Home

Jan 9, 2018 · Backend Development

Designing a Redis-Based Distributed Lock Service: Architecture and Implementation

This article explains how to replace traditional in‑process locks with a Redis‑backed distributed lock service, detailing the overall architecture, server and client designs, management features, lock lifecycle, grading strategies, and fallback options such as database and Zookeeper solutions.

BackendOptimistic LockRedis

0 likes · 7 min read

Designing a Redis-Based Distributed Lock Service: Architecture and Implementation

ITFLY8 Architecture Home

Aug 17, 2017 · Backend Development

Mastering High-Concurrency Flash Sale Systems: Architecture, Challenges, and Solutions

This article dissects the technical challenges of building a high‑concurrency flash‑sale (seckill) system—covering business analysis, traffic isolation, static page caching, CDN bandwidth, dynamic order URLs, request throttling, database sharding, optimistic locking, and anti‑cheat mechanisms—while presenting concrete architectural principles and code examples.

High ConcurrencyOptimistic Lockdistributed systems

0 likes · 36 min read

Mastering High-Concurrency Flash Sale Systems: Architecture, Challenges, and Solutions

Qunar Tech Salon

Jul 25, 2017 · Databases

Schemaless Document Model for Trading System Order Storage

The article explains how a schemaless JSON document model stored in a relational database can replace traditional relational tables for trading system orders, reducing schema change costs, improving flexibility, and ensuring consistency through version‑based optimistic locking and real‑time Elasticsearch indexing.

Document ModelElasticsearchOptimistic Lock

0 likes · 8 min read

Schemaless Document Model for Trading System Order Storage

Baidu Waimai Technology Team

Jul 11, 2017 · Backend Development

Handling Hotspot Accounts in Baidu Waimai Financial Accounting System: Challenges and Solutions

The article examines the upgrade to a balance‑based financial accounting system, defines hotspot accounts, explains why they pose concurrency challenges, and evaluates several technical solutions—including optimistic locking, asynchronous processing, and account splitting—to guide appropriate strategy selection for different business scenarios.

BackendConcurrencyOptimistic Lock

0 likes · 9 min read

Handling Hotspot Accounts in Baidu Waimai Financial Accounting System: Challenges and Solutions

Architecture Digest

Jun 14, 2017 · Backend Development

Techniques for Achieving High Concurrency: Optimistic Lock, Read‑Write Splitting, CDN, Caching, and Load Balancing

The article explains how high‑concurrency systems can be built by decomposing workloads through optimistic locking, read‑write database splitting, resource separation with CDN acceleration, dynamic‑to‑static conversion, caching, and load‑balancing strategies, providing practical code examples for each technique.

BackendCDNCaching

0 likes · 6 min read

Techniques for Achieving High Concurrency: Optimistic Lock, Read‑Write Splitting, CDN, Caching, and Load Balancing

Efficient Ops

Mar 5, 2017 · Operations

Surviving Hundred‑Billion Transactions: Real Production Incident Stories

This article recounts a series of real‑world production incidents—including massive concurrency overloads, DDoS attacks, SQL injection breaches, and critical bugs—encountered by an internet finance platform, and shares the concrete technical fixes and lessons learned to improve system resilience.

DDoSHigh ConcurrencyOptimistic Lock

0 likes · 22 min read

Surviving Hundred‑Billion Transactions: Real Production Incident Stories

ITFLY8 Architecture Home

Dec 11, 2016 · Backend Development

How to Build a High‑Concurrency Flash Sale System: Architecture, Challenges & Solutions

This article analyzes the flash‑sale (seckill) business model, outlines its unique technical challenges such as impact on existing services, database load, bandwidth spikes, URL security, button activation, and order handling, and then presents a comprehensive backend architecture, design principles, code examples, database sharding, caching, and consistency strategies to reliably support massive concurrent purchases.

CachingFlash SaleHigh Concurrency

0 likes · 32 min read

How to Build a High‑Concurrency Flash Sale System: Architecture, Challenges & Solutions

ITPUB

Oct 26, 2016 · Databases

Mastering Oracle Locks: Pessimistic, Optimistic, and Deadlock with Real‑World SQL demos

This guide explains Oracle's lock mechanisms—including shared, exclusive, row‑level, pessimistic, and optimistic locks—through step‑by‑step SQL sessions that illustrate update‑lost problems, lock contention, and deadlock detection, helping developers choose the right strategy for concurrency control.

Optimistic LockOraclePessimistic Lock

0 likes · 10 min read

Mastering Oracle Locks: Pessimistic, Optimistic, and Deadlock with Real‑World SQL demos

Java Backend Technology

Oct 25, 2016 · Databases

Why Locks Matter: Pessimistic vs Optimistic Concurrency Control Explained

This article explains why locks are needed in multi‑user environments, describes common conflict types such as lost updates and dirty reads, compares pessimistic and optimistic locking mechanisms, shows practical implementations with version numbers and SQL Server locks, and presents a classic financial‑system case study.

Optimistic LockPessimistic Locktransaction

0 likes · 8 min read

Why Locks Matter: Pessimistic vs Optimistic Concurrency Control Explained

Qunar Tech Salon

Jan 17, 2016 · Backend Development

Design and Technical Challenges of High‑Concurrency Flash Sale (Seckill) Systems

This article analyzes the characteristics and technical challenges of flash‑sale (seckill) systems, proposes isolation and static‑page strategies, outlines architecture principles, detailed front‑end and service‑layer designs, discusses database sharding, caching, concurrency control, overload protection, and anti‑cheat measures to ensure reliable high‑throughput order processing.

CachingFlash SaleHigh Concurrency

0 likes · 31 min read

Design and Technical Challenges of High‑Concurrency Flash Sale (Seckill) Systems

21CTO

Jan 7, 2016 · Backend Development

How to Build a High‑Performance Flash‑Sale System: Architecture, Challenges & Solutions

This article analyzes the complete flash‑sale workflow, identifies its unique characteristics and high‑concurrency technical challenges, and presents a layered architecture—including frontend static pages, request interception, queue design, database sharding, caching, optimistic locking, and anti‑cheating measures—to ensure reliability, scalability and data safety.

Flash SaleHigh ConcurrencyOptimistic Lock

0 likes · 34 min read

Architect

Nov 2, 2015 · Backend Development

Handling Overselling in High‑Concurrency Scenarios: Pessimistic, FIFO, and Optimistic Lock Strategies

The article explains why overselling occurs in flash‑sale systems under high concurrency, analyzes the drawbacks of pessimistic locking and FIFO queues, and presents optimistic locking with version control as a more efficient solution for ensuring thread‑safe inventory updates.

BackendFIFO queueOptimistic Lock

0 likes · 5 min read

Handling Overselling in High‑Concurrency Scenarios: Pessimistic, FIFO, and Optimistic Lock Strategies

21CTO

Sep 27, 2015 · Databases

Using Physical Primary Keys as Foreign Keys and Implementing Optimistic Locks

This article explains two key relational database design techniques: using auto‑increment or UUID physical primary keys for foreign key relationships, and employing optimistic locking with a version column to safely handle concurrent updates, while also covering when locks can be omitted.

Foreign KeyOptimistic LockSQL

0 likes · 6 min read

Using Physical Primary Keys as Foreign Keys and Implementing Optimistic Locks

21CTO

Sep 23, 2015 · Backend Development

How to Tackle 50k QPS Flash Sales: Backend Strategies for Extreme Concurrency

This article explores the challenges of handling tens of thousands of requests per second in flash‑sale systems, covering interface design, QPS calculations, overload protection, anti‑cheat measures, and data‑safety techniques such as pessimistic, optimistic, and queue‑based locking.

Flash SaleHigh ConcurrencyOptimistic Lock

0 likes · 16 min read

How to Tackle 50k QPS Flash Sales: Backend Strategies for Extreme Concurrency

21CTO

Sep 16, 2015 · Databases

Why Physical Primary Keys and Optimistic Locks Are Essential for Reliable DB Design

This article explains why using a physical primary key for foreign‑key relationships, how to implement optimistic locking with a version column for concurrent updates, and when it’s safe to update records without any locking, providing practical SQL examples for reliable database design.

Foreign KeyOptimistic LockSQL

0 likes · 6 min read

Why Physical Primary Keys and Optimistic Locks Are Essential for Reliable DB Design