chriso / roaring-bitmapLinks
Roaring bitmaps in C
☆17Updated 9 years ago
Alternatives and similar repositories for roaring-bitmap
Users that are interested in roaring-bitmap are comparing it to the libraries listed below
Sorting:
- Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…☆53Updated 12 years ago
- Automatically exported from code.google.com/p/libhhash☆32Updated 9 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- EWAH Compressed Bitmaps☆25Updated 4 years ago
- bit & sketches data structures☆60Updated 6 years ago
- Batch Monitor - Gain performance by combining work from multiple threads into a single batch☆30Updated 10 years ago
- Feed-forward Bloom filters☆52Updated 14 years ago
- Mirror of libslz☆34Updated 6 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- Fast 64 bit evolved hash.☆33Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Simple out-of-process invoker☆18Updated 2 weeks 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
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- Fast decoder for VByte-compressed integers☆123Updated last year
- Trlmdb is a replicating database using time stamps.☆14Updated 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
- Proof of concept LSM-tree built on MDB☆17Updated 10 years ago
- Prez is a distributed system based on Raft algorithm that provides highly reliable, consistent store.☆54Updated 10 years ago
- C based ordered key-value ACID DB using a skip list data structure☆162Updated 10 years ago
- Iterator library.☆79Updated 5 years ago
- ☆26Updated 8 years ago
- generate perfect hashes (alpha)☆77Updated 3 years ago
- Crit-bit tree (trie) library☆32Updated 11 years ago
- A library for Rapid {C|Concurrency|Correct} Development☆34Updated 9 years ago
- Durable dead simple queue that allows zero copy semantics. Durable under failure!☆18Updated 9 years ago
- Thread safe and multi-endian version of Bob Jenkins' spookyhash☆70Updated 4 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆36Updated 6 years ago