xxsds / multi_indexLinks
A C++ template library for compact Hamming distance indexes
☆10Updated 8 years ago
Alternatives and similar repositories for multi_index
Users that are interested in multi_index are comparing it to the libraries listed below
Sorting:
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- C++17 Implementation of Dynamic Filter Trie☆8Updated 3 years ago
- SUccinct Retrieval Framework☆20Updated 9 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- Teaching implementation of the TurboPFor integer compression algorithm☆22Updated 6 years ago
- Compact Tree Representation☆16Updated 8 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- ☆12Updated 7 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- A Go library for succinct partial sums data structure☆10Updated 10 years ago
- A Space-Optimal Grammar Compression☆10Updated 4 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆34Updated 3 months ago
- GPU-Accelerated Faster Decoding of Integer Lists☆13Updated 5 years ago
- Optimal suffix sorting and LCP array construction for constant alphabets [IPL 2017]☆9Updated 6 years ago
- Experimental search engine in C/C++17 - still in early development.☆27Updated 7 months ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- Dynamic succinct/compressed data structures☆112Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Clustered Elias-Fano inverted indexes.☆15Updated 6 years ago
- A Go library for space-efficient rank/select operations for both sparse and dense bit arrays.☆37Updated 4 years ago
- similarity join and search algorithms for edit distance and jaccard☆18Updated 7 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- A flexible tree-based index structure to support edit distance search on strings☆11Updated 7 years ago
- C++11 library for fast fuzzy searching☆14Updated 9 years ago