dominikkempa / zip-treeLinks
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
Sorting:
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Updated 2 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- Dynamic succinct/compressed data structures☆111Updated last year
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- Compact Tree Representation☆16Updated 8 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 7 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆50Updated 4 months ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆34Updated 9 months ago
- Succinct Data Structure Library 3.0☆95Updated 2 months ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated 8 months ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆20Updated 3 weeks ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆25Updated 2 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆31Updated 6 months ago
- Learned Monotone Minimal Perfect Hashing☆28Updated 6 months ago
- Fast in-place radix sort with STL-like API☆48Updated 8 years ago
- ☆38Updated 5 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Bloom-filter based minimal perfect hash function library☆265Updated 3 months ago
- 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 3 years ago
- Fast Approximate Membership Filters (C++)☆286Updated last month
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆51Updated 6 years ago
- TU DOrtmund lossless COMPression framework☆19Updated last year
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago