Joel Liu's personal annotations on this page
Joel bookmarked
on 2008-01-07
-
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
-
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.
This link has been bookmarked by 1 people . It was first bookmarked on 07 Jan 2008, by Joel Liu.
-
-
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
-
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.
-
Would you like to comment?
Join Diigo for a free account, or sign in if you are already a member.