efficient / ARFLinks
☆11Updated 7 years ago
Alternatives and similar repositories for ARF
Users that are interested in ARF are comparing it to the libraries listed below
Sorting:
- ☆27Updated 8 years ago
- A comparison between different integer set techniques☆14Updated 7 years ago
- Feed-forward Bloom filters☆53Updated 14 years ago
- RWMutex for sharing of multicore machines.☆18Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- Fast differential coding functions (using SIMD instructions)☆55Updated 7 years ago
- Compact tries for fixed-width keys☆26Updated 7 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Fast 64 bit evolved hash.☆34Updated 8 years ago
- NetBSD cdb (constant database) library☆14Updated 6 years ago
- ☆66Updated 5 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…☆53Updated 12 years ago
- simple consistent hashing implementation☆56Updated 7 years ago
- A high-performance, memory-efficient concurrent hash table☆36Updated 12 years ago
- Lock-free slab allocator / freelist.☆69Updated 10 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆43Updated 9 years ago
- Lock-free multithreaded memory allocation☆110Updated 8 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- fixed-length integer trim☆35Updated 2 years ago
- A software-based Ethernet switch design built around a memory-efficient, high-performance, and highly-concurrent hash table for compact a…☆37Updated 10 years ago
- an adaptive radix tree implementation in go☆69Updated 4 years ago
- qp tries and crit-bit tries☆122Updated 3 years ago
- The k-LSM: A relaxed, lock-free, linearizable priority queue☆23Updated 8 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 6 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- finding set bits in large bitmaps☆15Updated 10 years ago
- Embedded DB Benchmark Framework☆62Updated 5 years ago
- Compute xxHash hash codes for 8 keys in parallel☆47Updated 6 years ago
- C implementation of a caching and cache-filling library inspired to groupcache☆43Updated 9 years ago