ot / partitioned_elias_fano
Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
☆40Updated 10 years ago
Alternatives and similar repositories for partitioned_elias_fano:
Users that are interested in partitioned_elias_fano are comparing it to the libraries listed below
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- A library of inverted index data structures☆148Updated 2 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Clustered Elias-Fano inverted indexes.☆15Updated 6 years ago
- ☆25Updated 8 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 3 years ago
- Fast decoder for VByte-compressed integers☆122Updated 10 months ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 2 years ago
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆42Updated 8 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- Succinct C++☆24Updated 4 years ago
- A data structure and algorithm library built for TerarkDB☆62Updated 2 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆52Updated last year
- High-performance dictionary coding☆104Updated 7 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- LSM-trie☆113Updated 4 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆10Updated 9 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆33Updated last month
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 12 years ago
- ☆38Updated 4 years ago
- Automatically exported from code.google.com/p/tx-trie☆29Updated 9 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated 9 months ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago