TSXor: A Simple Time Series Compression Algorithm
☆53Feb 19, 2025Updated last year
Alternatives and similar repositories for TSXor
Users that are interested in TSXor are comparing it to the libraries listed below
Sorting:
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated 6 months ago
- Hugecast - The Off-Heap Storage for Hazelcast☆22Dec 1, 2013Updated 12 years ago
- A shortener url app for demonstrating distributed system a.k.a modern microservice architecture☆14Mar 13, 2019Updated 6 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Sep 12, 2022Updated 3 years ago
- simd enabled column imprints☆11Feb 12, 2018Updated 8 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Dec 11, 2022Updated 3 years ago
- IOManager tries to bridge the gap in existing async framework to build full async networked database/storage/keyvalue storage☆11Feb 7, 2026Updated 3 weeks ago
- SQL Optimizations using MLIR☆12Apr 5, 2020Updated 5 years ago
- Adaptive Radix Tree in C++☆51Updated this week
- Benchmark ingestion of the TSBS "dev ops" dataset into QuestDB via ILP using the `questdb` Python library and Pandas.☆33Mar 2, 2023Updated 3 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Feb 15, 2025Updated last year
- A fast implementation of the ECMA-182 CRC64 checksum using the CLMUL instruction set☆15Nov 1, 2016Updated 9 years ago
- Essential C++ utilities.☆14Nov 13, 2025Updated 3 months ago
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆14Feb 23, 2023Updated 3 years ago
- Concurrent (with OLC) Adaptive Radix Trie in Golang.☆11Jul 31, 2020Updated 5 years ago
- Grafite is a data structure that enables fast range emptiness queries using optimal space and time.☆14Dec 9, 2024Updated last year
- This is the official repo for the paper "A General Framework for Dynamic Succinct and Compressed Data Structures."☆13Oct 26, 2016Updated 9 years ago
- ☆12Mar 17, 2022Updated 3 years ago
- Official repository of the ACM SIGIR 2019 paper: "Fast Approximate Filtering of Search Results Sorted by Attribute" by Franco Maria Nardi…☆14Nov 7, 2019Updated 6 years ago
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆16Jun 13, 2020Updated 5 years ago
- Implementation of "Efficient Multi-vector Dense Retrieval with Bit Vectors", ECIR 2024☆68Oct 21, 2025Updated 4 months ago
- Self-Tuning Adaptive Radix Tree☆30Apr 19, 2020Updated 5 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆102Mar 30, 2023Updated 2 years ago
- Code for our paper "Evaluating SIMD Compiler-Intrinsics for Database Systems"☆16Jul 5, 2023Updated 2 years ago
- ☆16Mar 16, 2021Updated 4 years ago
- Incremental Slow Feature Analysis☆16Aug 29, 2014Updated 11 years ago
- ☆16Jan 24, 2025Updated last year
- Open-Channel SSD emulator using memory☆21Nov 1, 2017Updated 8 years ago
- BC-Tree and Ball-Tree for Point-to-Hyperplane NNS (ICDE 2023)☆18Aug 4, 2023Updated 2 years ago
- FreeARC Sources☆16Aug 31, 2015Updated 10 years ago
- ☆35May 18, 2019Updated 6 years ago
- ☆39Jun 20, 2020Updated 5 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46May 23, 2022Updated 3 years ago
- ☆20Jan 8, 2026Updated last month
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Dec 2, 2021Updated 4 years ago
- Frame-to-Frame Registration using Gaussian Mixture Models.☆23Mar 2, 2024Updated 2 years ago
- C implementation of a compressed trie lookup map☆23May 14, 2019Updated 6 years ago
- A C++ library to benchmark inverted indexes.☆21Aug 4, 2020Updated 5 years ago
- LLVM Bitcode parser in Rust☆25Dec 2, 2025Updated 3 months ago