Get the latest tech news
Ordered Insertion Optimization in OrioleDB
When many sessions try to insert into the same B-tree leaf page, classic exclusive page locking serializes progress and wastes time on sleep/wake cycles. We’re introducing a batch page insertion path that lets the session holding the page lock insert for itself and its neighbors. The result: dramatically reduced lock waits, and big gains at high client counts (2X throughput boost starting from 64 clients in our benchmark).
Every process waiting for the lock pays the cost of sleep → wake → re-check just to insert a tiny tuple. This is pure cooperation: no session is required to help others, but the lock holder has the best vantage point to make progress at a low cost for the group. If your workload shows skewed keys or time-based ordering(IoT, event logs, time-series dimensions, append-heavy OLTP), you’re a prime beneficiary.
Or read this on Hacker News