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 5 years ago
- ☆27Updated 8 years ago
- ViyaDB in-memory columnar analytical data store☆115Updated 5 years ago
- A cache-efficiency weight balanced binary tree☆70Updated 11 years ago
- Feed-forward Bloom filters☆53Updated 14 years ago
- A SQL-to-native-code compiler based on LLVM☆48Updated 9 years ago
- Embedded DB Benchmark Framework☆62Updated 4 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
- Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency☆75Updated 4 years ago
- consensus-yaraft is a library for distributed, strong consistent, highly replicated log storage. It's based on yaraft, which is an implem…☆29Updated 7 years ago
- A data structure and algorithm library built for TerarkDB☆67Updated 3 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 14 years ago
- A fork of Couchbase ForestDB project, aiming at making it simple and generic☆18Updated 6 months ago
- Distributed search engine in C++14, using nanomsg for communication, bond for serialization.☆67Updated 10 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 7 years ago
- Kosmos Distributed Filesystem☆29Updated 13 years ago
- Sample database with LLVM execution engine.☆11Updated 9 years ago
- Libhalog is an open-source high available redo-log library using multiple paxos.☆37Updated 7 years ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 6 years ago
- RWMutex for sharing of multicore machines.☆17Updated 6 years ago
- This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.☆95Updated 5 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- lock free modified prefix B+tree append-only database☆116Updated 10 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 6 years ago
- 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
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- Solitaire is a Faster Linearizability Checker Supporting Multiple Data Model☆17Updated 7 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