JoeLeavitt / SkipTrieLinks
☆12Updated 8 years ago
Alternatives and similar repositories for SkipTrie
Users that are interested in SkipTrie are comparing it to the libraries listed below
Sorting:
- Parallel boolean circuit evaluation☆26Updated 7 years ago
- Fastest RPC in the west☆21Updated 6 years ago
- ByteBuffer collection classes for java and jvm-based languages.☆33Updated 7 years ago
- Persistent Adaptive Radix Trees in Java☆82Updated 5 years ago
- Hornet, a JVM optimized for low-latency applications.☆53Updated 10 years ago
- High-performance dictionary coding☆108Updated 8 years ago
- Disk-backed hashmaps for Java☆31Updated 9 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆31Updated 4 years ago
- 64-bit integer compression algorithms in Java☆15Updated 7 years ago
- Sux4J is an effort to bring succinct data structures to Java.☆172Updated 6 months ago
- A fast and space efficient Radix tree in Java☆129Updated 5 years ago
- simple rules engine☆92Updated 5 years ago
- A Portable Persistent Memory Allocation Library☆14Updated 5 years ago
- Succinct data structures in C/C++☆92Updated last year
- A comparison between different integer set techniques☆14Updated 7 years ago
- Append-only key-value database on a distributed shared-log☆52Updated last year
- Immutable key/value store with efficient space utilization and fast reads. They are ideal for the use-case of tables built by batch proce…☆100Updated 2 years ago
- ☆17Updated 5 years ago
- C Minimal Perfect Hashing Library☆88Updated 8 years ago
- Lock-free multithreaded memory allocation☆110Updated 9 years ago
- Open Power Performance Analysis Tool☆28Updated 3 years ago
- Lightning Memory-Mapped Database (liblmdb) in Maven Central.☆35Updated 10 years ago
- Bloofi: A java implementation of multidimensional Bloom filters☆83Updated 6 months ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 6 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Fast algorithms for computing XX^T for binary matrices☆14Updated 6 years ago
- RocksDB modified to separate keys and values, resulting in a major decrease in write amplification without sacrificing performance☆56Updated 5 years ago
- Experiments on bit-slice indexing☆13Updated 10 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 15 years ago
- AirConcurrentMap is a fast, memory efficient Java ConcurrentNavigableMap implementation☆32Updated 8 years ago