simongog / surfLinks
SUccinct Retrieval Framework
☆20Updated 9 years ago
Alternatives and similar repositories for surf
Users that are interested in surf are comparing it to the libraries listed below
Sorting:
- ☆12Updated 7 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
- Experimental search engine in C/C++17 - still in early development.☆27Updated 9 months ago
- C++17 Implementation of Dynamic Filter Trie☆8Updated 3 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Dynamic succinct/compressed data structures☆112Updated last year
- A library of inverted index data structures☆150Updated 2 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- A C++ template library for compact Hamming distance indexes☆10Updated 8 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 3 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Compact Data Structures Library☆100Updated 3 years ago
- Implementation of QuadSketch algorithm☆11Updated 2 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 10 months ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 5 years ago
- Succinct C++☆24Updated 4 years ago
- Space efficient (graph) algorithms☆18Updated 4 years ago
- Succinct Data Structure Library☆106Updated 11 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 4 months ago
- A C++ library providing fast language model queries in compressed space.☆131Updated 2 years ago
- Compact Data Structures Library☆126Updated 10 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- Count-Min sketch-based approximate counting library☆45Updated 2 months ago
- LSH index for approximate set containment search☆58Updated 3 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Compact Tree Representation☆16Updated 8 years ago
- A Space-Optimal Grammar Compression☆10Updated 4 years ago