https://martinuke0.github.io/tags/concurrent-data-structures/ Recent content in Concurrent Data Structures on martinuke0's Blog https://martinuke0.github.io/%3Clink%20or%20path%20of%20image%20for%20opengraph,%20twitter-cards%3E https://martinuke0.github.io/%3Clink%20or%20path%20of%20image%20for%20opengraph,%20twitter-cards%3E Hugo -- 0.152.2 en Tue, 12 May 2026 12:11:32 +0000 https://martinuke0.github.io/posts/2026-05-12-implementing-lock-free-concurrent-b-trees-for-high-throughput-vector-indexing-in-distributed-systems/ Tue, 12 May 2026 12:11:32 +0000 https://martinuke0.github.io/posts/2026-05-12-implementing-lock-free-concurrent-b-trees-for-high-throughput-vector-indexing-in-distributed-systems/ <h2 id="introduction">Introduction</h2> <p>Vector indexing—whether for similarity search in recommendation engines, nearest‑neighbor queries in machine‑learning pipelines, or high‑dimensional feature retrieval in bioinformatics—has become a core workload in modern distributed systems. Traditional indexing structures (KD‑trees, LSH tables, inverted files) either suffer from poor cache locality or become bottlenecks when many threads try to update or query simultaneously.</p> <p>Enter the <strong>lock‑free concurrent B‑tree</strong>. By marrying the proven I/O‑optimal layout of B‑trees with the non‑blocking guarantees of lock‑free algorithms, we can achieve:</p>