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
Would you like to comment?
Join Diigo for a free account, or sign in if you are already a member.