Concurrent cache-oblivious B-trees

Authors: Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Bradley C. Kuszmaul

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: http://supertech.csail.mit.edu/papers/cobtree.pdf.

Subject Terms: Categories and Subject Descriptors, D.1.3 Programming Techniques Concurrent Programming—parallel programming, E.1 Data Structures Distributed Data Structures, E.1 Data Structures Trees, G.3 Probability and Statistics Probabilistic algorithms, General Terms, Algorithms, Theory. Keywords, Cache-Oblivious B-tree, Concurrent B-tree, Non- Blocking, Lock Free, Exponential Tree, Packed-Memory Array

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.6378; http://supertech.csail.mit.edu/papers/cobtree.pdf

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.6378
http://supertech.csail.mit.edu/papers/cobtree.pdf