jermp / clustered_elias_fano_indexesLinks
Clustered Elias-Fano inverted indexes.
☆15Updated 7 years ago
Alternatives and similar repositories for clustered_elias_fano_indexes
Users that are interested in clustered_elias_fano_indexes are comparing it to the libraries listed below
Sorting:
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- 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
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 5 years ago
- A C++ library for integer array compression☆29Updated 3 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Fast Approximate Membership Filters (C++)☆21Updated 4 years ago
- Succinct data structures in C/C++☆88Updated 10 months ago
- High-performance dictionary coding☆104Updated 8 years ago
- ☆38Updated 5 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 6 months ago
- ☆52Updated 9 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆46Updated 2 months ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated 2 years ago
- Implementation of the unary leapfrog join for efficient intersection of sorted sets.☆10Updated 5 years ago
- ☆12Updated 6 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Source code of our implementation of the concurrent RMA☆12Updated 6 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- A library of inverted index data structures☆150Updated 2 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Learned Monotone Minimal Perfect Hashing☆27Updated 4 months ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago