diegocaro / compressionLinks
Algorithms to compress sorted arrays of integers
☆17Updated 11 years ago
Alternatives and similar repositories for compression
Users that are interested in compression are comparing it to the libraries listed below
Sorting:
- Feed-forward Bloom filters☆52Updated 14 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- Implementation of Alexander A. Stepanov inverted Index Compression algorithms☆21Updated 9 years ago
- finding set bits in large bitmaps☆15Updated 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
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Lthread C++11 binding☆11Updated 10 years ago
- A system for maintaining replicated state machines☆115Updated 8 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 5 years ago
- Userspace file-system using the TokuFT fractal tree library☆23Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated 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
- Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store☆8Updated 6 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- EWAH Compressed Bitmaps☆25Updated 4 years ago
- Vectorized intersections (research code)☆16Updated 8 years ago
- RLU resizable hash-table☆17Updated 9 years ago
- Proof of concept LSM-tree built on MDB☆17Updated 10 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years 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
- NetBSD cdb (constant database) library☆14Updated 6 years ago
- ☆26Updated 8 years ago
- Roaring bitmaps in C☆17Updated 9 years ago
- A threaded, continuations-based I/O event library for manycore NUMA machines☆72Updated 4 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- A C++ library for integer array compression☆29Updated 3 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger☆33Updated 4 years ago