Re:Show HN: A fast append-only data store for Java 8
by dyladan on Tuesday April 14, 2015 @02:27PM
(#9376297)
Could be used as an event store. Rather than storing a list of mutable objects as in a normal database, you store the changes themselves as a list of facts. This makes things like replication a lot easier and can be optimized to be much faster than a traditional database.
Re:Show HN: A fast append-only data store for Java 8
by batbomb on Tuesday April 14, 2015 @02:31PM
(#9376312)
There's Apache BookKeeper to fill some of those needs.
Re:Show HN: A fast append-only data store for Java 8
by eropple on Tuesday April 14, 2015 @03:39PM
(#9376750)
I've never seen BookKeeper in production. Where would you recommend its use over something like Kafka?
Re:Show HN: A fast append-only data store for Java 8
by lomnakkus on Tuesday April 14, 2015 @04:35PM
(#9377140)
Great, but that's not a product. If you're on board with the CQRS/ES thing, actually building your own should not be difficult. (Ok, so I'm assuming non-distributed DB here, but with a bit of imagination one could also do infinitely(!) scalable CQRS/ES within Bounded Contexts, given the fresh crop of easily understandable/implementable concensus algorithms.)
Re:Show HN: A fast append-only data store for Java 8
by probablyfine on Tuesday April 14, 2015 @05:05PM
(#9377354)
I've used it as the backing for a time-series database and to store deltas for a state-machine - in both situations I wanted something that understood "POJOs" and didn't require a lot of setup.
Even in the case of multiple non-unique entries, if the stored objects are not meant to be mutable, the API exposes .reverse() to find the most recent.
As someone who is mystified by that statement: why?