RoaringBitmap / CBitmapCompetitionLinks
A comparison between different integer set techniques
☆14Updated 7 years ago
Alternatives and similar repositories for CBitmapCompetition
Users that are interested in CBitmapCompetition are comparing it to the libraries listed below
Sorting:
- ☆11Updated 7 years ago
- ☆66Updated 4 years ago
- ☆27Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- Feed-forward Bloom filters☆53Updated 14 years ago
- Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency☆75Updated 4 years ago
- A cache-efficiency weight balanced binary tree☆70Updated 11 years ago
- lock free modified prefix B+tree append-only database☆117Updated 10 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 14 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- RWMutex for sharing of multicore machines.☆17Updated 6 years ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 6 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- Libhalog is an open-source high available redo-log library using multiple paxos.☆37Updated 7 years ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Couchbase Key-Value Engine☆140Updated this week
- Consistent Hashing data structures and algorithms for C++☆39Updated 8 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆54Updated last year
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- A SQL-to-native-code compiler based on LLVM☆48Updated 9 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- A data structure and algorithm library built for TerarkDB☆67Updated 3 years ago
- ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.☆24Updated 10 years ago
- C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…☆78Updated 4 years ago
- memcachedb ported from BerkeleyDB to LMDB originally from http://memcachedb.googlecode.com/svn/trunk☆87Updated 10 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