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
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.β29Updated 2 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.β15Updated 6 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.β35Updated 2 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.β35Updated 2 years ago
- Bumped Ribbon Retrieval and Approximate Membership Queryβ42Updated this week
- SetSketch: Filling the Gap between MinHash and HyperLogLogβ49Updated 3 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.β17Updated 3 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.β48Updated 2 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.β29Updated 4 months ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functionsβ63Updated 9 months ago
- π³ A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.β11Updated 2 years ago
- Learned Monotone Minimal Perfect Hashingβ25Updated 3 months ago
- β53Updated 10 months ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.β19Updated 3 months ago
- An encoder/decoder collection for a sequence of integersβ32Updated 12 years ago
- Fast in-place radix sort with STL-like APIβ46Updated 8 years 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
- High-speed Bloom filters and taffy filters for C, C++, and Javaβ35Updated last year
- COllapsed and COmpressed trie: a data-aware compressed string dictionaryβ33Updated last month
- Wavelet tree based on a fixed block boosting techniqueβ16Updated 3 years ago
- A blend of the compact and sparse hash table implementations.β12Updated 3 years ago
- For details, see the blog post:β32Updated last year
- String map implementation through Fast Succinct Trieβ21Updated 3 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)β52Updated 7 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".β56Updated 2 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexesβ25Updated 2 years ago
- In-place Parallel Super Scalar Radix Sort (IPSΒ²Ra)β30Updated 2 months ago