jermp / opt_vbyte
Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
β17Updated 3 years ago
Related projects β
Alternatives and complementary repositories for opt_vbyte
- π³ A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.β11Updated 2 years ago
- Clustered Elias-Fano inverted indexes.β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β40Updated 4 years ago
- C++ Implementation of Zip Treesβ13Updated 2 years ago
- Hash table with separate chaining layoutβ9Updated 3 years ago
- An encoder/decoder collection for a sequence of integersβ32Updated 11 years ago
- Compact Tree Representationβ16Updated 7 years ago
- String map implementation through Fast Succinct Trieβ21Updated 3 years ago
- Learned Monotone Minimal Perfect Hashingβ23Updated 2 months ago
- High-speed Bloom filters and taffy filters for C, C++, and Javaβ32Updated last year
- Fast implementations of the scancount algorithm: C++ header-only libraryβ25Updated 5 years ago
- β37Updated 4 years ago
- Suite of universal indexes for Highly Repetitive Document Collectionsβ20Updated 4 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?β27Updated 3 years ago
- A Space-Optimal Grammar Compressionβ10Updated 3 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)β51Updated 7 years ago
- A blend of the compact and sparse hash table implementations.β12Updated 3 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.β28Updated last year
- Bumped Ribbon Retrieval and Approximate Membership Queryβ39Updated last month
- COllapsed and COmpressed trie: a data-aware compressed string dictionaryβ33Updated 11 months ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequencesβ52Updated 10 months ago
- C++ Library implementing Compressed String Dictionariesβ45Updated 2 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Sergβ¦β10Updated 6 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.β48Updated 2 years ago
- β10Updated 3 years ago
- Interleaving bits from two sources using SIMD instructions.β14Updated 6 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Referenceβ50Updated 8 months ago
- Universe-sliced indexes in C++.β17Updated last year
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.β26Updated 2 months ago