ot / partitioned_elias_fanoLinks
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
Sorting:
- A library of inverted index data structures☆150Updated 2 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- Fast decoder for VByte-compressed integers☆124Updated 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
- High-performance dictionary coding☆104Updated 8 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- W-TinyLFU cache C++11 header only implementation☆62Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- ☆26Updated 8 years ago
- Algorithms to compress sorted arrays of integers☆18Updated 11 years ago
- A data structure and algorithm library built for TerarkDB☆66Updated 3 years ago
- ☆66Updated 4 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
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 5 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Succinct data structures in C/C++☆88Updated 10 months ago
- Feed-forward Bloom filters☆52Updated 14 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- LSM-trie☆114Updated 4 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- General purpose C++ library for iZENECloud☆42Updated 10 years ago
- A comparison between different integer set techniques☆14Updated 7 years ago
- Persistent Memory Graph Database☆43Updated 2 years ago
- Succinct C++☆24Updated 4 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago