WojciechMula / integer-sequence-encoding
Experiments with encoding/compression integer sequences using different algorithms
☆13Updated 10 years ago
Related projects ⓘ
Alternatives and complementary repositories for integer-sequence-encoding
- Algorithms to compress sorted arrays of integers☆18Updated 10 years ago
- Rabin fingerprinting and deduplication library in C☆26Updated 8 years ago
- Fast differential coding functions (using SIMD instructions)☆50Updated 6 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆53Updated 10 months ago
- Header-only vectorized, lazy-decoding, zero-copy CSV file parser☆97Updated 4 months ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- EWAH Compressed Bitmaps☆25Updated 4 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 4 years ago
- Succinct C++☆25Updated 4 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆115Updated 7 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆62Updated 5 months ago
- Transpose: SIMD Integer+Floating Point Compression Filter☆59Updated 5 years ago
- Fast and Strong Burrows Wheeler Model☆19Updated 6 years ago
- A hash table implementation using Robin Hood Linear Probing☆50Updated 10 years ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- String Matching Algorithms Research Tool☆98Updated 7 months ago
- C library to compute the Hamming weight of arrays☆44Updated 5 years ago
- Automatically exported from code.google.com/p/mmc☆26Updated 2 years ago
- A C++ library for integer array compression☆27Updated 2 years ago
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆22Updated 2 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆26Updated last week
- C library to pack and unpack short arrays of integers as fast as possible☆85Updated last year
- A C++ skip list with Python bindings. This can be used to calculate a rolling median - fast!☆47Updated 3 months ago
- Provide an idiomatic C++ interface to CPython's C API.☆27Updated 7 years ago
- ☆49Updated 4 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 2 months ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated last year
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆50Updated 9 months ago