jermp / opt_vbyteLinks
Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
☆17Updated 3 years ago
Alternatives and similar repositories for opt_vbyte
Users that are interested in opt_vbyte are comparing it to the libraries listed below
Sorting:
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated 8 months ago
- ☆38Updated 5 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated 2 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- Succinct data structures in C/C++☆88Updated last year
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Compact Tree Representation☆16Updated 8 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆48Updated 4 months ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- Learned Monotone Minimal Perfect Hashing☆28Updated 6 months ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 7 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 3 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- Clustered Elias-Fano inverted indexes.☆15Updated 7 years ago
- ☆12Updated 4 years ago
- Source code of our implementation of the concurrent RMA☆12Updated 6 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- ☆27Updated 8 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆31Updated 6 months ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- Dictionary-based compression for inverted indexes.☆23Updated 6 years ago