Show HN: A fast append-only data store for Java 8
probablyfine.co.uk
probablyfine.co.uk
Example:
https://github.com/mrwilson/java-dirty/blob/master/src/main/...
private int getPartition(int globalInsertionPosition) {
return (globalInsertionPosition) / this.sizePerPartition;
}(genuine question, I haven't stayed current with Java)
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?
Please don't make rude comments on Hacker News.
I'm surrounded by intelligent people that can't get anything done.
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.
Have look at my profile. Also there is KVEngine from H2.