java-concurrent-hash-trie-map
Java port of a concurrent trie hash map implementation from the Scala collections library (by romix)
lasher
Lasher is an embeddable key-value store written in Java. (by soundvibe)
Our great sponsors
java-concurrent-hash-trie-map | lasher | |
---|---|---|
1 | 1 | |
150 | 4 | |
- | - | |
0.0 | 0.0 | |
over 3 years ago | over 1 year ago | |
Java | Java | |
GNU General Public License v3.0 or later | Apache License 2.0 |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
java-concurrent-hash-trie-map
Posts with mentions or reviews of java-concurrent-hash-trie-map.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2020-12-21.
lasher
Posts with mentions or reviews of lasher.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2020-12-21.
-
Solution for hash-map with >100M values
Do you need to update the data after initial load? If not, then I would suggest using my Paldb fork , otherwise you could try my lasher library. It's in early stage but first results are very promising, I was testing it with 10-100M elements and the performance was similar to java hashmap.
What are some alternatives?
When comparing java-concurrent-hash-trie-map and lasher you can also consider the following projects:
SmoothieMap - A gulp of low latency Java
Oak - A Scalable Concurrent Key-Value Map for Big Data Analytics
Chronicle Map - Replicate your Key Value Store across your network, with consistency, persistance and performance.
MapDB - MapDB provides concurrent Maps, Sets and Queues backed by disk storage or off-heap-memory. It is a fast and easy to use embedded Java database engine.
PalDB - An embeddable key-value store written in Java
time-series-concurrency-example - Time Series Data and CompletableFuture example in Java
whippet-db - Fast embedded key-value database engine for Java.
java-concurrent-hash-trie-map vs SmoothieMap
lasher vs Oak
java-concurrent-hash-trie-map vs Chronicle Map
lasher vs SmoothieMap
java-concurrent-hash-trie-map vs MapDB
lasher vs PalDB
java-concurrent-hash-trie-map vs Oak
lasher vs MapDB
lasher vs Chronicle Map
lasher vs time-series-concurrency-example
lasher vs whippet-db