gvinciguerra / la_vectorLinks
πΆ Compressed bitvector/container supporting efficient random access and rank queries
β43Updated 8 months ago
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
- C++ Implementation of Zip Treesβ14Updated 2 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.β30Updated last month
- Parallel Wavelet Tree and Wavelet Matrix Constructionβ26Updated last year
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Sergβ¦β10Updated 6 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.β29Updated 2 years ago
- Bumped Ribbon Retrieval and Approximate Membership Queryβ44Updated 2 weeks ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.β48Updated 2 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.β35Updated 2 years ago
- Succinct Data Structure Library 3.0β94Updated last month
- β53Updated last year
- Compact Tree Representationβ16Updated 8 years ago
- Fast in-place radix sort with STL-like APIβ46Updated 8 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLogβ49Updated 3 years ago
- C++ Library implementing Compressed String Dictionariesβ46Updated 3 years ago
- Dynamic succinct/compressed data structuresβ112Updated last year
- Parallel Suffix Array, LCP Array, and Suffix Tree Constructionβ49Updated 5 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.β15Updated 7 years ago
- Learned Monotone Minimal Perfect Hashingβ27Updated 2 months ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionaryβ34Updated 3 months ago
- β12Updated 3 years ago
- A fast and memory efficient hashmap using sorting to resolve collisionsβ43Updated 4 years ago
- β38Updated 4 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
- testbed for different SIMD implementations for set intersection and set unionβ41Updated 5 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?β29Updated 4 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)β86Updated 4 years ago
- In-place Parallel Super Scalar Radix Sort (IPSΒ²Ra)β31Updated 4 months ago
- Succinct C++β24Updated 4 years ago
- External memory suffix array construction using inducingβ11Updated 4 years ago