MatteoCeregini / quad-wavelet-treeLinks
β11Updated 2 years ago
Alternatives and similar repositories for quad-wavelet-tree
Users that are interested in quad-wavelet-tree are comparing it to the libraries listed below
Sorting:
- Parallel Wavelet Tree and Wavelet Matrix Constructionβ25Updated 2 years ago
- πΆ Compressed bitvector/container supporting efficient random access and rank queriesβ46Updated last year
- Dynamic succinct/compressed data structuresβ112Updated last year
- Bloom-filter based minimal perfect hash function libraryβ267Updated 3 months ago
- Succinct Data Structure Library 3.0β95Updated 2 months ago
- In-place Parallel Super Scalar Radix Sort (IPSΒ²Ra)β34Updated 9 months ago
- Wavelet tree based on a fixed block boosting techniqueβ16Updated 4 years ago
- Efficient Prefix-Sum data structures in C++.β25Updated 2 years ago
- Ultra fast MSD radix sorterβ10Updated 5 years ago
- Fast Approximate Membership Filters (C++)β286Updated 2 months ago
- C++ Implementation of Zip Treesβ14Updated 3 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.β14Updated 7 years ago
- Compact Tree Representationβ16Updated 8 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.β17Updated 3 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLogβ48Updated 4 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindingsβ154Updated last year
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating thβ¦β116Updated 10 months ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.β48Updated 3 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.β31Updated 7 months ago
- βοΈ PTHash is a fast and compact minimal perfect hash function.β244Updated this week
- π Fast C/C++ bit population count libraryβ354Updated last year
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.β20Updated last month
- BitMagic Libraryβ433Updated 2 months ago
- testbed for different SIMD implementations for set intersection and set unionβ41Updated 5 years ago
- std::map/std::set implementation using the adaptive radix treeβ15Updated 4 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionaryβ36Updated 8 months ago
- An optimal space run-length Burrows-Wheeler transform full-text indexβ65Updated 2 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functionsβ64Updated last year
- Bumped Ribbon Retrieval and Approximate Membership Queryβ50Updated 4 months ago
- memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sortβ26Updated 4 years ago