News for hackers. Stuff that matters.

A comment on Show HN: Gun v0.1.0 – The Easiest Database Ever. Parent comment

Re:Show HN: Gun v0.1.0 – The Easiest Database Ever by sseveran on Thursday February 19, 2015 @08:19PM (#9078346)
It relies on the data being commutative. If the data is not commutative then we need, wait for it, drum roll please, some consistency, which by your own admission is not provided. The consistency is the hard part which is why there is an entire field of study on just this problem.

I fail to see how your merge algorithm is deterministic in case of failures.

[ Parent | on HN ]
Re:Show HN: Gun v0.1.0 – The Easiest Database Ever by karlgrz on Friday February 20, 2015 @02:11AM (#9079347)
You -cannot- have a distribute database without consistency. Prove us ALL wrong, please.
[ Parent | on HN ]
Re:Show HN: Gun v0.1.0 – The Easiest Database Ever by marknadal on Friday February 20, 2015 @03:44PM (#9082880)
Maybe I wasn't clear... GUN does have Eventual consistency, but not strong/global consistency.

Aka GUN is AP and Eventually consistent. You manually at the application layer can decide to lock, sacrificing Availability, and get strong consistency.

The merge algorithm works in an Eventually consistent case, but obviously is too naive for global Consistency, you'd need some form of consensus.

Or does that not address your comment?

[ Parent | on HN ]