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 4 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
- ☆53Updated last year
- Fast Approximate Membership Filters (C++)☆23Updated 4 years ago
- High-performance dictionary coding☆108Updated 8 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Updated 7 months ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 6 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆33Updated 4 years ago
- ☆39Updated 5 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆89Updated 5 years ago
- Code used in the paper "On dynamic succinct graph representations".☆11Updated 4 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 4 years ago
- Universe-sliced indexes in C++.☆18Updated 3 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 5 months ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Updated 3 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆24Updated 5 years ago
- ☆12Updated 7 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- FishStore is a prototype fast ingestion and querying layer for flexible-schema data☆232Updated 2 years ago
- Stream processing engine☆13Updated 4 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆65Updated last year
- Source code of our implementation of the concurrent RMA☆12Updated 6 years ago
- TSXor: A Simple Time Series Compression Algorithm☆53Updated 11 months ago
- Succinct data structures in C/C++☆92Updated last year
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated 2 years ago