testbed for different SIMD implementations for set intersection and set union
☆41Jan 29, 2020Updated 6 years ago
Alternatives and similar repositories for SIMDSetOperations
Users that are interested in SIMDSetOperations are comparing it to the libraries listed below
Sorting:
- benchmarking positional population count☆17Oct 19, 2025Updated 4 months ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52May 2, 2017Updated 8 years ago
- AVX-2 vectorised 8-bit positional popcount for Go☆23Aug 28, 2020Updated 5 years ago
- An encoder/decoder collection for a sequence of integers☆32Mar 10, 2013Updated 12 years ago
- Vectorized intersections (research code)☆16Jan 13, 2017Updated 9 years ago
- Dremel DB Column Striping and Record Assembly Algorithms in Golang☆21Jul 11, 2013Updated 12 years ago
- Compact tries for fixed-width keys☆26Jun 4, 2018Updated 7 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…☆31Jan 23, 2019Updated 7 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Jan 23, 2020Updated 6 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆24May 14, 2020Updated 5 years ago
- fixed-length integer trim☆35Mar 20, 2023Updated 2 years ago
- ☆37Nov 5, 2020Updated 5 years ago
- Experiments with array layouts for comparison-based searching☆87Jan 5, 2024Updated 2 years ago
- ReBucket: group panic()s by similarity☆12Nov 1, 2019Updated 6 years ago
- A simple database optimized for returning results by custom scoring functions.☆21Mar 29, 2016Updated 9 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Dec 16, 2019Updated 6 years ago
- Quick sort code using AVX2 instructions☆69Jun 5, 2017Updated 8 years ago
- ☆11Apr 19, 2018Updated 7 years ago
- Code used in the paper "On dynamic succinct graph representations".☆11Sep 2, 2021Updated 4 years ago
- ☆12Jun 25, 2021Updated 4 years ago
- github.com/cznic/interval has moved to modernc.org/interval☆11Nov 22, 2018Updated 7 years ago
- Aerie: a regex-like engine nested word grammars☆16Feb 5, 2022Updated 4 years ago
- A small DFA for under 16 states☆54Jun 6, 2018Updated 7 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Apr 19, 2024Updated last year
- Experimental search engine in C/C++17 - still in early development.☆27Sep 5, 2025Updated 5 months ago
- Detailed experiments over simdjson for VLDB article (2019) and future work☆21Oct 3, 2020Updated 5 years ago
- A C++ library to compress and intersect sorted lists of integers using SIMD instructions☆444Jul 7, 2025Updated 7 months ago
- A fast implementation for varbyte 32bit/64bit integer compression☆121Feb 19, 2017Updated 9 years ago
- Implementation of the unary leapfrog join for efficient intersection of sorted sets.☆10Dec 4, 2019Updated 6 years ago
- BitMagic Library☆443Aug 26, 2025Updated 6 months ago
- A C++ library for integer array compression☆30Mar 18, 2022Updated 3 years ago
- ☆27Mar 23, 2017Updated 8 years ago
- ☆17Mar 12, 2019Updated 6 years ago
- A Trie data structure that allows for fuzzy string matching☆11May 24, 2015Updated 10 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Sep 13, 2018Updated 7 years ago
- High-performance dictionary coding☆109Apr 5, 2017Updated 8 years ago
- KLL sketch: Almost Optimal Streaming Quantiles☆35Aug 12, 2016Updated 9 years ago
- A header-only bloom filter implementation in C++14.☆14Sep 10, 2018Updated 7 years ago