jermp / opt_vbyteLinks
Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
☆17Updated 4 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:
- ☆39Updated 5 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated 10 months ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Updated 2 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆50Updated 6 months ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Compact Tree Representation☆16Updated 8 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆31Updated 4 years ago
- Learned Monotone Minimal Perfect Hashing☆31Updated 8 months ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- Clustered Elias-Fano inverted indexes.☆15Updated 7 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- ☆53Updated last year
- Succinct data structures in C/C++☆92Updated last year
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- ☆12Updated 4 years ago
- Succinct C++☆24Updated 5 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated 2 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Updated 2 years ago
- Fast Approximate Membership Filters (C++)☆288Updated 4 months ago
- C++ Implementation of Zip Trees☆14Updated 3 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Updated 3 years ago
- High-performance dictionary coding☆108Updated 8 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 4 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆65Updated last year
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆54Updated last year