andybbruno / TSXorLinks
TSXor: A Simple Time Series Compression Algorithm
☆52Updated 3 months ago
Alternatives and similar repositories for TSXor
Users that are interested in TSXor are comparing it to the libraries listed below
Sorting:
- ALP: Adaptive Lossless Floating-Point Compression☆105Updated last month
- High-performance dictionary coding☆104Updated 8 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Learned Monotone Minimal Perfect Hashing☆27Updated 2 months ago
- Adaptive Radix Tree in C++☆45Updated last week
- Sprintz time series compression algorithm☆69Updated last year
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆53Updated last year
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- AVX512F and AVX2 versions of quick sort☆105Updated 7 years ago
- ☆20Updated 2 years ago
- Cache-Sensitive Skip List.☆22Updated 7 years ago
- Fast Approximate Membership Filters (C++)☆278Updated 5 months ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- An adaptive radix tree for efficient indexing in main memory.☆161Updated last year
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- ☆38Updated 4 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆44Updated 2 weeks ago
- based on the work of Harald Lang when at CWI☆23Updated 5 years ago
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆229Updated last week
- ☆28Updated last year
- A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA☆76Updated 4 years ago
- ☆53Updated last year
- Clustered Elias-Fano inverted indexes.☆15Updated 7 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …☆88Updated 3 years ago
- ☆44Updated 4 years ago