andybbruno / TSXorLinks
TSXor: A Simple Time Series Compression Algorithm
☆53Updated 5 months ago
Alternatives and similar repositories for TSXor
Users that are interested in TSXor are comparing it to the libraries listed below
Sorting:
- Fast Approximate Membership Filters (C++)☆281Updated 7 months ago
- ALP: Adaptive Lossless Floating-Point Compression☆112Updated 3 months ago
- Adaptive Radix Tree in C++☆45Updated 2 weeks ago
- An adaptive radix tree for efficient indexing in main memory.☆162Updated last year
- 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
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- ☆52Updated 8 months ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 5 months ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- A curated list of resources related to Seastar, an industrial-grade C++ framework for building high-performance servers.☆105Updated 10 months ago
- ☆38Updated 5 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- Sprintz time series compression algorithm☆68Updated last year
- Bumped Ribbon Retrieval and Approximate Membership Query☆46Updated last month
- A data structure and algorithm library built for TerarkDB☆66Updated 3 years ago
- Library for lock-free locks☆82Updated 2 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆86Updated 4 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆54Updated last year
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …☆87Updated 3 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- a quotient filter written in C☆86Updated 7 years ago
- a high performance cache simulator and library☆106Updated 11 months ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Concurrent trie-hash map library☆92Updated last year