Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

This is a really interesting look at an aspect of consistency I hadn't previously given a lot of thought to, although it's implicit in a lot of discussions around data modeling with eventual consistency, and I hope it starts a longer conversation.

Eventual consistency in a distributed database is hard enough for application developers to reason about without adding streaming computation concerns.

With Riak 2.0, at Basho we were trying to address that complexity with two different approaches: offering a strong consistency model based on Multi-Paxos, and building CRDTs into Riak to give applications more robust/easier to use primitives.

Unfortunately the company folded before either effort yielded much fruit.



Did basho have any internal discussion about how to ensure that operations reading and writing from multiple CRDTs were still confluent? The only work I've seen on this is http://www.neilconway.org/docs/socc2012_bloom_lattices.pdf but that seems like a better fit for a streaming system than for a general database.


I honestly don't recall; I was more a kibitzer in that realm.

Chris Meiklejohn with the Lasp project would be a good person to reach out to.

https://github.com/lasp-lang/lasp


Oh, I have seen some of the lasp papers. And I guess https://dl.acm.org/doi/abs/10.1145/2578855.2535842 is related too. Some of the stuff coming out of the RISE lab too eg https://rise.cs.berkeley.edu/projects/anna/.

> The only work I've seen on this is

Honestly, my brain in the morning...




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: