Concurrent cache-oblivious b-trees

This paper presents concurrent cache-oblivious (CO) B-trees. We extend the cache-oblivious model to a parallel or distributed setting and present three concurrent CO B-trees. Our first data structure is a concurrent lock-based exponential CO B-tree. This data structure supports insertions and non-blocking searches/successor queries. The second and third data structures are lock-based and lock-free variations, respectively, on the packed-memory CO Btree. These data structures support range queries and deletions in addition to the other operations. Each data structure achieves the same serial performance as the original data structure on which it is based. In a concurrent setting, we show that these data structures are linearizable, meaning that completed operations appear to an outside viewer as though they occurred in some serialized order. The lock-based data structures are also deadlock free, and the lock-free data structure guarantees forward progress by at least one process.

• Type: Conference
• Year: 2005
• Where: SPAA
• Authors: Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Bradley C. Kuszmaul
• Keywords: Co B-tree, Concurrent Co B-trees, Data Structure, Distributed And Parallel Computing, SPAA 2005