BestHub
Sign in
Tagged articles

Optimistic Concurrency

3 articles · Page 1 of 1
Big Data Technology Tribe
Big Data Technology Tribe
Jul 30, 2025 · Backend Development

How InfiniFS Optimizes Metadata Access with Optimistic Cache and Lazy Invalidation

This article explains InfiniFS's cache organization for directory metadata, its optimistic cache usage, and the lazy invalidation mechanism that broadcasts rename updates to a few metadata servers, enabling scalable and efficient metadata services in large‑scale distributed file systems.

Cache DesignMetadata CachingOptimistic Concurrency
0 likes · 7 min read
How InfiniFS Optimizes Metadata Access with Optimistic Cache and Lazy Invalidation
Architecture & Thinking
Architecture & Thinking
Apr 2, 2024 · Operations

How to Ensure Data Consistency in High‑Concurrency Distributed Systems

This article explores the challenges of maintaining data consistency under high concurrency in distributed systems, reviewing common consistency issues, distributed lock implementations, optimistic and pessimistic strategies, CAS and ABA problems, and practical solutions such as Redis locks, Zookeeper, and transaction protocols.

CASData ConsistencyDistributed Lock
0 likes · 15 min read
How to Ensure Data Consistency in High‑Concurrency Distributed Systems
dbaplus Community
dbaplus Community
Mar 7, 2016 · Databases

How SQL Server Hekaton Supercharges OLTP with In‑Memory, Latch‑Free Architecture

This article examines the performance bottlenecks of traditional relational databases, explains how SQL Server 2014's In‑Memory OLTP (Hekaton) uses latch‑free Bw‑tree structures, optimistic timestamp‑based concurrency, and native compilation to achieve orders‑of‑magnitude speedups, and discusses its practical limits and real‑world case studies.

Database PerformanceHekatonIn-Memory OLTP
0 likes · 20 min read
How SQL Server Hekaton Supercharges OLTP with In‑Memory, Latch‑Free Architecture