A practical scalable distributed B-tree
Popularity Report
 |
|||
|
|||
|
|||
|
|||
|
|||
|
Rank
URL Tag Cloud
Bookmark History
Saved by 1 people (0 private), first by anonymouse user on 2008-01-07
- Joel on 2008-01-07 - Tags algorithms , b-tree , distribute
Public Sticky notes
We propose a new algorithm for a practical, fault- tolerant, and scalable B-tree distributed over a set of servers. Our algorithm supports practical features not present in prior work: transactions that allow atomic execution of multiple operations over multiple B-trees, online migration of
Highlighted by joel
We implemented our approach and show that its performance and scalability are comparable to previous schemes, yet it offers many additional practical features. We believe that our approach is quite general and can be used to implement other distributed data structures easily.
Highlighted by joel
Public Comment