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.
3. I've not tested these failure cases yet.
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 Tuesday April 14, 2015 @04:37PM
(#9377155)
You don't get things done very fast, do you?
Re:Show HN: A fast append-only data store for Java 8
by dang on Tuesday April 14, 2015 @09:04PM
(#9378320)
> You don't get things done very fast, do you?
Please don't make rude comments on Hacker News.
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.
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?