java-concurrent-hash-trie-map
Concurrent Trie
An implementation of a concurrent hash array mapped trie data structure for thread-safe and lock-free map operations.
Java port of a concurrent trie hash map implementation from the Scala collections library
151 stars
16 watching
25 forks
Language: Java
last commit: over 4 years ago
Linked from 1 awesome list
Related projects:
Repository | Description | Stars |
---|---|---|
| A collection of concurrent hash map implementations in C++. | 1,409 |
| A C++ implementation of fast hash maps and sets using robin hood hashing | 1,294 |
| A compile-time implementation of a data structure used in word games and text search applications. | 12 |
| A concurrent data structure implementation for efficient tree-based operations with atomic cloning and snapshot isolation. | 148 |
| A memory-efficient hash map and set implementation with flexible growth policies and support for heterogeneous lookups. | 337 |
| A data structure implementation for efficient approximate string matching and retrieval. | 9 |
| A concurrent hash table implementation | 36 |
| A compact data structure for efficiently storing and retrieving strings | 47 |
| A high-performance, thread-safe map solution for Go. | 92 |
| A concurrent thread-safe hash map implemented in C++. | 145 |
| Runs promise-returning & async functions multiple times concurrently | 39 |
| A fast hash map and hash set implementation using hopscotch hashing | 731 |
| A library that provides modern concurrency tools for parallel processing in Crystal | 48 |
| A data structure library for building eventually consistent systems with concurrent updates and merging operations | 651 |
| A consistent hashing library and its language bindings allow efficient distribution of data across servers. | 943 |