dominikkempa / zip-tree
C++ Implementation of Zip Trees
β14Updated 2 years ago
Alternatives and similar repositories for zip-tree:
Users that are interested in zip-tree are comparing it to the libraries listed below
- πΆ Compressed bitvector/container supporting efficient random access and rank queriesβ43Updated 6 months ago
- Compact Tree Representationβ16Updated 7 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.β29Updated 3 months ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.β15Updated 6 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.β35Updated 2 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.β48Updated 2 years ago
- Learned Monotone Minimal Perfect Hashingβ25Updated 3 months ago
- LZ Double factor Factorization.β11Updated 8 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.β29Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.β35Updated 2 years ago
- Bumped Ribbon Retrieval and Approximate Membership Queryβ41Updated last week
- Parallel Wavelet Tree and Wavelet Matrix Constructionβ26Updated last year
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.β17Updated 3 years ago
- π³ A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.β11Updated 2 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLogβ49Updated 3 years ago
- In-place Parallel Super Scalar Radix Sort (IPSΒ²Ra)β30Updated last month
- Wavelet tree based on a fixed block boosting techniqueβ16Updated 3 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.β19Updated 3 months ago
- A fast and memory efficient hashmap using sorting to resolve collisionsβ43Updated 4 years ago
- Universe-sliced indexes in C++.β18Updated 2 years ago
- β53Updated 9 months ago
- String map implementation through Fast Succinct Trieβ21Updated 3 years ago
- C++17 implementation of memory-efficient dynamic triesβ58Updated 3 years ago
- C++ Library implementing Compressed String Dictionariesβ46Updated 2 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Javaβ35Updated last year
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Sergβ¦β10Updated 6 years ago
- Hash table with separate chaining layoutβ9Updated 3 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)β84Updated last year
- An encoder/decoder collection for a sequence of integersβ32Updated 12 years ago
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.β20Updated 2 years ago