ot / ds2iLinks
A library of inverted index data structures
☆150Updated 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
- A collection of succinct data structures☆209Updated last year
- Trinity IR Infrastructure☆239Updated 5 years ago
- Fast decoder for VByte-compressed integers☆125Updated last year
- An efficient trie implementation.☆255Updated 4 years ago
- A C++ library to compress and intersect sorted lists of integers using SIMD instructions☆439Updated 2 months ago
- Compact Data Structures Library☆101Updated 3 years ago
- Simhashing in C++☆135Updated 2 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆50Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- General purpose C++ library for iZENECloud☆43Updated 10 years ago
- Succinct Data Structure Library☆107Updated 12 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- A high performance search engine☆107Updated 8 years ago
- Dynamic succinct/compressed data structures☆110Updated last year
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Succinct data structures in C/C++☆88Updated 11 months ago
- A benchmark of some prominent C/C++ hash table implementations☆105Updated 6 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- LSM-trie☆114Updated 4 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- Bloom-filter based minimal perfect hash function library☆265Updated 2 months ago
- Compact Tree Representation☆16Updated 8 years ago
- Big Data Made Easy☆185Updated 7 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆128Updated 2 years ago
- Supersonic is an ultra-fast, column oriented query engine library written in C++☆207Updated 5 years ago
- A C++ library providing fast language model queries in compressed space.☆132Updated 2 years ago