patmorin / arraylayoutLinks
Experiments with array layouts for comparison-based searching
☆84Updated last year
Alternatives and similar repositories for arraylayout
Users that are interested in arraylayout are comparing it to the libraries listed below
Sorting:
- multi-way atomic compare-and-swap with x64/TSX☆86Updated 8 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆118Updated 8 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- Hash Array Mapped Trie (C++ Templates)☆124Updated 2 years ago
- High-performance multicore-scalable data structures and benchmarks☆140Updated 5 years ago
- bit & sketches data structures☆60Updated 6 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- Compact Data Structures Library☆100Updated 2 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
- nkvdb - is a numeric time-series database.☆35Updated 8 years ago
- Quick sort code using AVX2 instructions☆69Updated 7 years ago
- C library to compute the Hamming weight of arrays☆46Updated 6 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- Linear vs binary search benchmark☆40Updated 5 years ago
- A fast alternative to the modulo reduction☆308Updated 4 years ago
- Fast differential coding functions (using SIMD instructions)☆53Updated 7 years ago
- transducers in C++ 14☆40Updated 10 years ago
- An-source C library developed and used at AppNexus.☆109Updated 5 years ago
- Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.☆134Updated 5 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated last year
- Comparing linear and binary searches☆40Updated 5 years ago
- qp tries and crit-bit tries☆119Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆136Updated 4 months ago
- Compact Data Structures Library☆126Updated 10 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- A small DFA for under 16 states☆51Updated 6 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- ☆106Updated last year