mklarqvist / StormBitmapsLinks
Fast algorithms for computing XX^T for binary matrices
☆14Updated 6 years ago
Alternatives and similar repositories for StormBitmaps
Users that are interested in StormBitmaps are comparing it to the libraries listed below
Sorting:
- A fast implementation for varbyte 32bit/64bit integer compression☆120Updated 8 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Updated 2 years ago
- ☆12Updated 8 years ago
- Multiplying... backward?☆14Updated 5 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆46Updated 5 years ago
- Bloom filter alternative (C++)☆18Updated 7 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 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
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆65Updated last year
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- Fast Hash Functions Using AES Intrinsics☆84Updated 6 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated 2 years ago
- High-performance dictionary coding☆108Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- Detailed experiments over simdjson for VLDB article (2019) and future work☆21Updated 5 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 5 years ago
- Parallel boolean circuit evaluation☆26Updated 7 years ago
- A Minimal Perfect Hash Function Library☆169Updated 4 years ago
- ☆14Updated 7 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- A benchmark for sorting algorithms☆62Updated 4 years ago
- qp tries and crit-bit tries☆122Updated 3 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 6 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆88Updated 4 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- Vectorized intersections (research code)☆16Updated 8 years ago
- Compute xxHash hash codes for 8 keys in parallel☆47Updated 6 years ago