stxxl / foxxllLinks
FOundation of stXXl and thriLL
☆14Updated last year
Alternatives and similar repositories for foxxll
Users that are interested in foxxll are comparing it to the libraries listed below
Sorting:
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Dynamic succinct/compressed data structures☆111Updated last year
- Succinct Data Structure Library☆107Updated 11 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- C library to compute the Hamming weight of arrays☆48Updated 6 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- Ultra fast MSD radix sorter☆11Updated 5 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- A collection of string sorting algorithms☆56Updated 3 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 7 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated 2 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆34Updated 7 months ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Succinct Data Structure Library 3.0☆96Updated 3 weeks ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 6 years ago
- Vectorized intersections (research code)☆16Updated 8 years ago
- GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org☆136Updated 2 years ago
- Compact Data Structures Library☆128Updated 11 years ago
- Compact Tree Representation☆16Updated 8 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 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
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆31Updated 5 months ago
- TU DOrtmund lossless COMPression framework☆19Updated last year
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆54Updated last year
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆87Updated 4 years ago