andybbruno / TSXorLinks
TSXor: A Simple Time Series Compression Algorithm
☆53Updated 4 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☆107Updated 2 months ago
- Fast Approximate Membership Filters (C++)☆279Updated 6 months ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- An adaptive radix tree for efficient indexing in main memory.☆161Updated last year
- Adaptive Radix Tree in C++☆45Updated last month
- ☆38Updated 5 years ago
- Sprintz time series compression algorithm☆69Updated last year
- A curated list of resources related to Seastar, an industrial-grade C++ framework for building high-performance servers.☆104Updated 10 months ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 5 months ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA☆76Updated 4 years ago
- a high performance cache simulator and library☆106Updated 11 months ago
- ☆52Updated 7 months ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆46Updated 2 years ago
- HOT - Height Optimized Trie☆154Updated 7 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- based on the work of Harald Lang when at CWI☆23Updated 5 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- A fast SIMD parser for CSV files☆155Updated 3 years ago
- Next-Gen Big Data File Format☆245Updated this week
- Bumped Ribbon Retrieval and Approximate Membership Query☆45Updated last month
- An embedded key-value store library specialized for building state machine and log store☆233Updated 3 weeks ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆80Updated 3 years ago
- (Det)erministic deadl(ock) resolution for high-throughput, low-latency, and strongly consistent data stores.☆24Updated 2 months ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆86Updated 4 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Query engine synthesizer based on, our domain-specific language, VOILA☆13Updated 4 years ago