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
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆53Updated last year
- ☆26Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- A cache-efficiency weight balanced binary tree☆69Updated 11 years ago
- Simple RPC in C++, with Python binding☆27Updated 10 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 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
- Feed-forward Bloom filters☆52Updated 13 years ago
- Fast differential coding functions (using SIMD instructions)☆53Updated 7 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- W-TinyLFU cache C++11 header only implementation☆59Updated 6 years ago
- C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…☆76Updated 4 years ago
- A C++ Raft implementation, project moved☆24Updated 8 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- A very fast and small(memory efficient) hash map☆7Updated 9 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
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- A fork of Couchbase ForestDB project, aiming at making it simple and generic☆18Updated 2 months ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 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
- General purpose C++ library for iZENECloud☆42Updated 10 years ago
- ☆66Updated 4 years ago
- zookeeper c++11. Uses facebook folly.☆9Updated 9 years ago
- ☆13Updated 6 years ago