amallia / gpu-integers-compression
GPU-Accelerated Faster Decoding of Integer Lists
☆13Updated 5 years ago
Related projects: ⓘ
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 2 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆28Updated last year
- Interleaving bits from two sources using SIMD instructions.☆14Updated 6 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- testbed for different SIMD implementations for set intersection and set union☆38Updated 4 years ago
- A blend of the compact and sparse hash table implementations.☆12Updated 3 years ago
- Clustered Elias-Fano inverted indexes.☆14Updated 6 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆24Updated 4 years ago
- Fast algorithms for computing XX^T for binary matrices☆14Updated 4 years ago
- Universe-sliced indexes in C++.☆17Updated last year
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆19Updated 4 years ago
- An encoder/decoder collection for a sequence of integers☆31Updated 11 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆40Updated 2 weeks ago
- C++ Library implementing Compressed String Dictionaries☆45Updated 2 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆50Updated 7 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆47Updated 3 years ago
- Bloom filter alternative (C++)☆17Updated 5 years ago
- Efficient Prefix-Sum data structures in C++.☆24Updated 11 months ago
- Dictionary-based compression for inverted indexes.☆22Updated 5 years 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☆48Updated 7 months ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆58Updated 7 months ago
- MlpIndex - Extremely fast ordered index via memory level parallelism☆12Updated 5 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆44Updated 4 years ago
- Hash table with separate chaining layout☆9Updated 2 years ago
- SUccinct Retrieval Framework☆19Updated 8 years ago
- C++ Implementation of Zip Trees☆13Updated last year
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆26Updated 3 years ago