Hacker News Reader

Efrim-Lipkinon Show HN: FaunaDB, a strongly consistent, globally distributed cloud database

Okay, Last question because I'm in Asia and it's 7:30 and I am tired. (But yea, I'm a Midwestern computer scientist who just happens to be in Asia ;-)

Question #2 -- Two, or Three, or More transactions occur simultaneously that want to change data D. each of these transactions send out transaction logs that contradict each other. What happens?

Efrim-Lipkinon Show HN: FaunaDB, a strongly consistent, globally distributed cloud database

This is a very good answer. So if I understand you correctly (please correct if I do not), atomicity is handled on a per connection basis (writes cannot be distrubted). And there may be high latency in distributing a transaction, but read consistency is guaranteed by timestamp (equivalent to versioning).

Is this correct?

Efrim-Lipkinon Show HN: FaunaDB, a strongly consistent, globally distributed cloud database

Hi guys. Can I ask a simple question?

I understand that we are talking about a globally distributed, serverless and yet consistent relational database.

My question is about latency. How long does it take for transactional atomicity to become a consistent read on a globally distributed database? (1) And what are the measures taken between entry nodes to prevent clients from recieving inconsistent data? (2)

As I ponder this, I am struck by not the consistency problem, as that is solvable. But I am struck by the latency problem of assuring that all global queries are consistent for some (any) time quanta. What sort of latency should be expected?

both questions (1) and (2) are interesting, but (1) is critical while (2) is academic.

Thanks, and very interesting work guys.