andybbruno / TSXor
TSXor: A Simple Time Series Compression Algorithm
☆50Updated 11 months ago
Related projects: ⓘ
- High-speed Bloom filters and taffy filters for C, C++, and Java☆32Updated last year
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆26Updated 3 years ago
- ☆36Updated 4 years ago
- An adaptive radix tree for efficient indexing in main memory.☆147Updated 6 months ago
- Clustered Elias-Fano inverted indexes.☆14Updated 6 years ago
- High-performance dictionary coding☆102Updated 7 years ago
- based on the work of Harald Lang when at CWI☆21Updated 4 years ago
- testbed for different SIMD implementations for set intersection and set union☆38Updated 4 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆128Updated 2 years ago
- C++17 implementation of memory-efficient dynamic tries☆57Updated 2 years ago
- ☆43Updated 3 years ago
- A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA☆67Updated 3 years ago
- Fast Approximate Membership Filters (C++)☆258Updated 8 months ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆25Updated 2 weeks ago
- Adaptive Radix Tree in C++☆36Updated last week
- A curated list of resources related to Seastar, an industrial-grade C++ framework for building high-performance servers.☆91Updated last week
- ☆36Updated 5 months ago
- Hiactor is a distributed C++ actor framework.☆102Updated 3 months ago
- A fast approximate membership query data structure☆10Updated 2 months ago
- String map implementation through Fast Succinct Trie☆19Updated 3 years ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆22Updated 7 months ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- C++ Library implementing Compressed String Dictionaries☆45Updated 2 years ago
- AVX512F and AVX2 versions of quick sort☆102Updated 6 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆46Updated 2 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆31Updated 9 months ago
- Fast and compact minimal perfect hash functions in C++.☆187Updated 3 weeks ago
- InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.☆41Updated 4 months ago
- Self-Tuning Adaptive Radix Tree☆26Updated 4 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆28Updated last year