ot / path_decomposed_tries
Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
☆55Updated last year
Related projects ⓘ
Alternatives and complementary repositories for path_decomposed_tries
- C++ Library implementing Compressed String Dictionaries☆45Updated 2 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆52Updated 10 months ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆21Updated 2 years ago
- Universe-sliced indexes in C++.☆17Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- Fast implementations of the scancount algorithm: C++ header-only library☆25Updated 5 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆28Updated last year
- finding set bits in large bitmaps☆15Updated 8 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- Compact Data Structures Library☆98Updated 2 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 11 years ago
- ☆25Updated 7 years ago
- Compact Tree Representation☆16Updated 7 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆61Updated 5 months ago
- Compressed double-array tries for static string dictionaries☆11Updated 5 years ago
- Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"☆57Updated 11 years ago
- SUccinct Retrieval Framework☆19Updated 8 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 2 months ago
- Clustered Elias-Fano inverted indexes.☆14Updated 6 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆51Updated 7 years ago
- testbed for different SIMD implementations for set intersection and set union☆40Updated 4 years ago
- Implementation of Alexander A. Stepanov inverted Index Compression algorithms☆21Updated 8 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆40Updated 7 years ago
- Compact Data Structures Library☆124Updated 10 years ago
- A C++ library for integer array compression☆27Updated 2 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆49Updated 6 months ago