gvinciguerra / la_vectorLinks
πΆ Compressed bitvector/container supporting efficient random access and rank queries
β46Updated last year
Alternatives and similar repositories for la_vector
Users that are interested in la_vector are comparing it to the libraries listed below
Sorting:
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.β35Updated 2 years ago
- Dynamic succinct/compressed data structuresβ111Updated last year
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.β31Updated 5 months ago
- C++ Implementation of Zip Treesβ14Updated 2 years ago
- Succinct Data Structure Library 3.0β95Updated last month
- A Benchmark of Minimal Perfect Hash Function Algorithms.β38Updated 2 years ago
- In-place Parallel Super Scalar Radix Sort (IPSΒ²Ra)β34Updated 8 months ago
- Bumped Ribbon Retrieval and Approximate Membership Queryβ48Updated 3 months ago
- Bloom-filter based minimal perfect hash function libraryβ265Updated 2 months ago
- SetSketch: Filling the Gap between MinHash and HyperLogLogβ48Updated 4 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.β30Updated 2 years ago
- Learned Monotone Minimal Perfect Hashingβ28Updated 6 months ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.β48Updated 3 years ago
- Parallel Wavelet Tree and Wavelet Matrix Constructionβ25Updated 2 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.β14Updated 7 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionaryβ35Updated 7 months ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.β19Updated 2 months ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindingsβ154Updated last year
- Compact Tree Representationβ16Updated 8 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).β55Updated 5 years ago
- In-place Parallel Super Scalar Samplesort (IPSβ΄o)β126Updated 8 months ago
- βοΈ PTHash is a fast and compact minimal perfect hash function.β237Updated last week
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)β87Updated 4 years ago
- testbed for different SIMD implementations for set intersection and set unionβ41Updated 5 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Constructionβ50Updated 6 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental rβ¦β107Updated 10 years ago
- A collection of succinct data structuresβ209Updated last year
- AVX512F and AVX2 versions of quick sortβ104Updated 7 years ago
- FOundation of stXXl and thriLLβ14Updated last year
- A fast and memory efficient hashmap using sorting to resolve collisionsβ43Updated 4 years ago