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:
- A benchmark of some prominent C/C++ hash table implementations☆105Updated 6 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
- Lthread C++11 binding☆11Updated 10 years ago
- Library containing high-performance datastructures and utilities for C++☆74Updated 8 years ago
- Feed-forward Bloom filters☆52Updated 14 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- Low-Level Data Structure - efficient data structures, and fast data access in the 3.x/4.x/5.x/6.x kernel☆120Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- finding set bits in large bitmaps☆15Updated 9 years ago
- ☆26Updated 8 years ago
- RLU resizable hash-table☆17Updated 9 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Userspace file-system using the TokuFT fractal tree library☆23Updated 3 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- MDBM a very fast memory-mapped key/value store.☆77Updated 2 years ago
- Fast decoder for VByte-compressed integers☆123Updated last year
- Linear vs binary search benchmark☆40Updated 5 years ago
- A system for maintaining replicated state machines☆115Updated 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
- Iterator library.☆79Updated 5 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
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- C++ implementation of concurrent Binary Search Trees☆72Updated 9 years ago
- A splaytree ADT written in C with a BSD license☆18Updated 5 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- EWAH Compressed Bitmaps☆25Updated 4 years ago