ot / ds2iLinks
A library of inverted index data structures
☆151Updated 2 years ago
Alternatives and similar repositories for ds2i
Users that are interested in ds2i are comparing it to the libraries listed below
Sorting:
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- An efficient trie implementation.☆255Updated 4 years ago
- A collection of succinct data structures☆210Updated last year
- A C++ library to compress and intersect sorted lists of integers using SIMD instructions☆438Updated 3 months ago
- Trinity IR Infrastructure☆238Updated 5 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- Fast decoder for VByte-compressed integers☆125Updated last year
- A high performance search engine☆107Updated 8 years ago
- General purpose C++ library for iZENECloud☆43Updated 10 years ago
- Succinct Data Structure Library☆107Updated 12 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆51Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆128Updated 2 years ago
- Simhashing in C++☆135Updated 2 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Big Data Made Easy☆185Updated 7 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆43Updated 8 years ago
- LSM-trie☆114Updated 4 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…☆78Updated 4 years ago
- Dynamic succinct/compressed data structures☆111Updated last year
- ☆81Updated 7 years ago
- Bloom-filter based minimal perfect hash function library☆266Updated 3 months ago
- Simple baselines for "Learned Indexes"☆158Updated 7 years ago
- Example project presented at the Succinct Data Structure Tutorial at SIGIR 2016☆26Updated 6 years ago