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
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- LSM-trie☆114Updated 4 years ago
- Fast decoder for VByte-compressed integers☆125Updated last year
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- ☆27Updated 8 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- A data structure and algorithm library built for TerarkDB☆67Updated 3 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- C library to compute the Hamming weight of arrays☆48Updated 6 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 6 years ago
- Succinct C++☆24Updated 5 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- A collection of succinct data structures☆209Updated last year
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- A key/value database based on SkimpyStash.☆13Updated 10 years ago
- Algorithms to compress sorted arrays of integers☆18Updated 11 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Automatically exported from code.google.com/p/tx-trie☆29Updated 10 years ago
- Persistent Memory Graph Database☆44Updated 2 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆87Updated 4 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆53Updated last year
- Learned Monotone Minimal Perfect Hashing☆28Updated 6 months ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago