Experiments with array layouts for comparison-based searching
☆87Jan 5, 2024Updated 2 years ago
Alternatives and similar repositories for arraylayout
Users that are interested in arraylayout are comparing it to the libraries listed below
Sorting:
- testbed for different SIMD implementations for set intersection and set union☆41Jan 29, 2020Updated 6 years 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
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Jun 16, 2025Updated 8 months ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆58Jan 27, 2023Updated 3 years ago
- SIMDized check which bytes are in a set☆28Oct 21, 2018Updated 7 years ago
- Vectorized intersections (research code)☆16Jan 13, 2017Updated 9 years ago
- A Lightweight Graph Processing Framework for Multi-GPUs☆14Apr 15, 2015Updated 10 years ago
- Intriman is a documentation generator that retargets the Intel Intrinsics Guide to other documentation formats☆28Jun 15, 2022Updated 3 years ago
- String map implementation through Fast Succinct Trie☆23Jul 9, 2021Updated 4 years ago
- Create man pages from information used by Intel Intrinsics Guide and optionally uops.info☆46Dec 16, 2024Updated last year
- Lightweight SSA compiler suite☆11Sep 27, 2024Updated last year
- qp tries and crit-bit tries☆124Jul 12, 2022Updated 3 years ago
- Generates benchmark data for two different data structures, then renders some graphs.☆112Sep 4, 2019Updated 6 years ago
- Compact tries for fixed-width keys☆26Jun 4, 2018Updated 7 years ago
- A C implementation of a Boldi-Vigna graph decompressor☆17Jul 5, 2016Updated 9 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- Universe-sliced indexes in C++.☆18Jan 8, 2023Updated 3 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
- Go implementation of SIMD-BP128 integer encoding and decoding☆31Apr 8, 2022Updated 3 years ago
- A C++ library for integer array compression☆30Mar 18, 2022Updated 3 years ago
- ☆15Dec 2, 2019Updated 6 years ago
- ☆16Jun 19, 2014Updated 11 years ago
- C library to pack and unpack short arrays of integers as fast as possible☆94Mar 11, 2023Updated 2 years ago
- blending sam with the shell experiment☆23Mar 25, 2019Updated 6 years ago
- A distributed key-value cache with builtin materialized views.☆25Nov 14, 2014Updated 11 years ago
- LLVM-jitted bitmaps☆27Apr 23, 2020Updated 5 years ago
- Frog is Asynchronous Graph Processing on GPU with Hybrid Coloring Model. The fundamental idea is based on Pareto principle (or 80-20 rule…☆36May 29, 2021Updated 4 years ago
- unrolled skip list library for C☆22May 25, 2019Updated 6 years ago
- A Simple Algorithm for Minimum Cuts in Near-Linear Time (SWAT '20)☆12Apr 24, 2020Updated 5 years ago
- 🚀 Fast C/C++ bit population count library☆360Jun 29, 2024Updated last year
- ☆21Feb 26, 2019Updated 7 years ago
- High-performance dictionary coding☆109Apr 5, 2017Updated 8 years ago
- being a code junkie☆22Jul 15, 2022Updated 3 years ago
- LSM-trie☆115Mar 22, 2021Updated 4 years ago
- Not Another Range Library☆39Mar 9, 2014Updated 11 years ago
- A collection of demonstration languages in Lua/Terra suitable for learning or for forking when creating a new language☆11Aug 27, 2015Updated 10 years ago
- Implementation of a Backpack Quotient Filter☆13Jul 7, 2025Updated 7 months ago
- FNV hash collision generator☆12Mar 2, 2017Updated 8 years ago
- A sparse and compressed bitmap library.☆13Aug 28, 2014Updated 11 years ago