sillycross / mlpds
MlpIndex - Extremely fast ordered index via memory level parallelism
☆12Updated 6 years ago
Alternatives and similar repositories for mlpds:
Users that are interested in mlpds are comparing it to the libraries listed below
- Dictionary-based compression for inverted indexes.☆23Updated 6 years ago
- SIMD-accelerated UTF-8 to UTF-32 conversion☆11Updated 6 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- Support for ternary logic in SSE, XOP, AVX2 and x86 programs☆31Updated 4 months ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Multiplying... backward?☆13Updated 4 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- Bloom filter alternative (C++)☆18Updated 6 years ago
- Counting the collisions with perl hash tables per function☆12Updated 5 years ago
- measure entropy of memory allocators☆12Updated 3 years ago
- unrolled skip list library for C☆21Updated 5 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- Shuffle-based predicate matcher and all-round branch free swiss army chainsaw☆17Updated 6 years ago
- A vectorized single header hash function.☆19Updated 5 months ago
- Some variations on Lemire's Fast Random Integer Generation in an Interval☆15Updated 5 years ago
- A splaytree ADT written in C with a BSD license☆18Updated 4 years ago
- Supporting code for the concurrency hierarchy described in this blog post: https://travisdowns.github.io/blog/2020/07/06/concurrency-cost…☆26Updated 3 years ago
- A Parallelism Profiler with What-If analyses for Intel Threading Building Blocks (TBB) programs☆13Updated 7 years ago
- Link to this library and it will log all the LibC functions you are calling and how much time you are spending in them!☆18Updated 4 months ago
- Octosort is an in-place stable adaptive block merge sort.☆18Updated 2 years ago
- Improved NetBSD's Perfect Hash Generation Tool v3☆19Updated last year
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- Vectorized intersections (research code)☆15Updated 8 years ago
- Batched random number generation☆17Updated last week
- Benchmark supporting baseless libel against clang-format☆11Updated 5 years ago
- Benchmarking reading and parsing integers from a file in C++.☆9Updated 5 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago