New Berkeley DB Release Includes Replication

Chairman writes: "Sleepycat Software (disclaimer -- I work there) just released version 4.0 of Berkeley DB. This version adds support for replication, so apps can survive single- or multi-node hardware or software failures without interruption in service. With the interest in replication by users of MySQL and other SQL databases, an embedded engine that provides the same services might be interesting to Slashdot readers."

What is the propagation time to replicas?

[Anonymous Coward]

The explanation says 'instantly', but that's got to be an exaggeration. Also, with many separate write operations occurring simultaneously, what kind of latency will this replication start to have?

Re:What is the propagation time to replicas?

[Linux_ho]

The explanation says 'instantly', but that's got to be an exaggeration.

No, seriously, the DB data is replicated INSTANTLY through a quantum non-locality much like the photon twin phenomenon. Those Sleepycat guys are really amazing.

Re:What is the propagation time to replicas?

[Anonymous Coward]

They ought to put that on the box!

Sleepycat Berkley DB
Now with QUANTUM NON-LOCALITY and FTL DATA REPLICATION!

Re:What is the propagation time to replicas?

[king_ramen]

I think this uses TCP multicast, so after transport issues/dlays have been resolved, there should be a listening thread that receives the update request into memory, and makes the change once any locks are freed, which may take a while (in computational terms) on long transactions.

there are several async processes, so each request will be unique, but the point they are trying to make is that notifications are sent out immediately.

i am more interested in their robustness model their ability to deal with network faults.

kevin