Re:Show HN: A fast append-only data store for Java 8
by famousactress on Tuesday April 14, 2015 @05:46PM
(#9377583)
Haha, no worries! I've been checked out of Java for a while and I was a little bit worried that this was semantically meaningful, which would be a pretty confusing addition to the language :)
Re:Show HN: A fast append-only data store for Java 8
by nicksellen on Tuesday April 14, 2015 @02:08PM
(#9376174)
How would you compare and contrast this with http://openhft.net/products/chronicle-queue/? (which I knows does a bunch more but seems like it could be used for this purpose too).
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 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.
Re:Show HN: A fast append-only data store for Java 8
by rakoo on Tuesday April 14, 2015 @02:46PM
(#9376411)
If you know your data has no duplicate (eg, you want to sort and store a list of cities), you know you don't need to check the already-written objects; you only need to append objects.
Re:Show HN: A fast append-only data store for Java 8
by jerven on Tuesday April 14, 2015 @03:35PM
(#9376721)
Really nice, I am just needing this ;) Super that it is MIT licensed as well. I was halfway on building something on top of XZ SeekableInput Streams but this is probably a lot saner to use ;)
Re:Show HN: A fast append-only data store for Java 8
by hello_there on Tuesday April 14, 2015 @04:22PM
(#9377040)
Great. I've been wanting something like this for a while. I've got a few questions:
1. How large files are supported?
2. It says that it will only persist primitive fields on objects - does that exclude persisting a byte array?
3. What are the failure semantics? For example, what happens if my computer's power supply fails in the middle of a write? How will the program behave the next time it is started?
Re:Show HN: A fast append-only data store for Java 8
by probablyfine on Tuesday April 14, 2015 @05:01PM
(#9377321)
Hi, glad you like it.
1. Under the hood it partitions the log into sections to avoid Java's MappedByteBuffer size-limit. I've not tried to deliberately push the file-size limit yet, but it's something to add to the benchmarks when I publish them (soon!)
2. It doesn't support primitive arrays as of 1.4, but this is something that I have considered in future versions. Pull requests are definitely welcome.
Re:Show HN: A fast append-only data store for Java 8
by javajosh on Tuesday April 14, 2015 @04:34PM
(#9377133)
Good questions, but wouldn't it be fun to find out the answers using empirical tests? You might even be able to add tests and submit a PR, and be immortalized in the annals of github.
Re:Show HN: A fast append-only data store for Java 8
by mrits on Wednesday April 15, 2015 @07:07PM
(#9384857)
It is a legitimate response to a problem that plagues the hacker community. Focus on the task at hand. Trying to understand the intricacies of a system can be educational but the best lessons learned are from completing your current project.
I'm surrounded by intelligent people that can't get anything done.
Re:Show HN: A fast append-only data store for Java 8
by dang on Wednesday April 15, 2015 @07:48PM
(#9385016)
Ok, but the problem with your previous comment wasn't your view, but the rudeness. It's possible to express your view without rudeness; you just did. That's what we're going for here.
Example:
https://github.com/mrwilson/java-dirty/blob/master/src/main/...
(genuine question, I haven't stayed current with Java)
http://stackoverflow.com/a/9268065
http://engineering.linkedin.com/distributed-systems/log-what...
As someone who is mystified by that statement: why?
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.
1. How large files are supported?
2. It says that it will only persist primitive fields on objects - does that exclude persisting a byte array?
3. What are the failure semantics? For example, what happens if my computer's power supply fails in the middle of a write? How will the program behave the next time it is started?
1. Under the hood it partitions the log into sections to avoid Java's MappedByteBuffer size-limit. I've not tried to deliberately push the file-size limit yet, but it's something to add to the benchmarks when I publish them (soon!)
2. It doesn't support primitive arrays as of 1.4, but this is something that I have considered in future versions. Pull requests are definitely welcome.
3. I've not tested these failure cases yet.
Please don't make rude comments on Hacker News.
I'm surrounded by intelligent people that can't get anything done.
Have look at my profile. Also there is KVEngine from H2.