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.☆17Updated 6 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Compact tries for fixed-width keys☆26Updated 7 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…☆53Updated 12 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 7 years ago
- Fast 64 bit evolved hash.☆34Updated 8 years ago
- simple consistent hashing implementation☆56Updated 7 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- Paxos protocol variants framework☆26Updated 7 years ago
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- The k-LSM: A relaxed, lock-free, linearizable priority queue☆23Updated 8 years ago
- Iterator library.☆79Updated 5 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 14 years ago
- A high-performance, memory-efficient concurrent hash table☆36Updated 12 years ago
- ☆66Updated 5 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆42Updated 8 years ago
- ☆24Updated 11 years ago
- Assembly-optimized Marvin32 hash function☆12Updated last year
- Utility to measure the performance of pcap network interfaces.☆21Updated 4 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- Compute xxHash hash codes for 8 keys in parallel☆46Updated 6 years ago
- A distributed key-value cache with builtin materialized views.☆25Updated 10 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- Dependably fast multi-core in-memory transactions☆21Updated 8 years ago