Reducing Lock Contention with Side Pointers in B‑link Trees
Side pointers provide a low‑overhead way to break hot‑spot locks in B‑link trees, improving scalability without sacrificing correctness.
Lock-Contention
Side pointers provide a low‑overhead way to break hot‑spot locks in B‑link trees, improving scalability without sacrificing correctness.