Concurrent In-memory Indexes

Concurrent Btree

Concurrent Btree's concurrency control is based on Optimistic locking principle. Salient features of this concurrency control are

• Very simple - minimal changes to code to support concurrency
• Good scalability

References

• OLFIT (optimistic, latch-free index traversal) Concurrency control