DynaTree is a scalable and highly available B+tree over partitioned state machine replication. DynaTree employs the partitioned state machine replication model that partitions the application state and replicates each partition. Tree operations are atomically multicast to the partitions involved in the request, and then executed. Atomic multicast ensures that requests are properly ordered across partitions to ensure that replicas end up in the same state after execution.
meslahik / dynatree Goto Github PK
View Code? Open in Web Editor NEWA scalable and highly available B+tree
License: GNU General Public License v2.0