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
Alternatives and similar repositories for Proteus
Users that are interested in Proteus are comparing it to the libraries listed below
Sorting:
- Code repository for SNARF☆13Apr 27, 2023Updated 2 years ago
- Grafite is a data structure that enables fast range emptiness queries using optimal space and time.☆14Dec 9, 2024Updated last year
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated 6 months ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Feb 15, 2025Updated last year
- Dynamic Cuckoo Filter (DCF) is succinct data structure of approximate set representing and membership testing for large-scale dynamic dat…☆39Nov 16, 2017Updated 8 years ago
- Compact Tree Representation☆16Mar 16, 2017Updated 8 years ago
- An SLA-Oriented LSM-Tree Key-Value Store for High-end Cloud Data Service☆17Jan 24, 2021Updated 5 years ago
- 知乎文章附带代码☆15Jan 26, 2023Updated 3 years ago
- BC-Tree and Ball-Tree for Point-to-Hyperplane NNS (ICDE 2023)☆18Aug 4, 2023Updated 2 years ago
- ☆14Feb 15, 2024Updated 2 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Jun 16, 2025Updated 8 months ago
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Mar 17, 2025Updated 11 months ago
- PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)☆24Jun 7, 2023Updated 2 years ago
- Succinct C++☆24Sep 13, 2020Updated 5 years ago
- (Det)erministic deadl(ock) resolution for high-throughput, low-latency, and strongly consistent data stores.☆28May 12, 2025Updated 9 months ago
- String map implementation through Fast Succinct Trie☆23Jul 9, 2021Updated 4 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
- ☆27May 27, 2022Updated 3 years ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆28Feb 2, 2024Updated 2 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆34Apr 7, 2025Updated 10 months ago
- JSONPath Streaming with Bit-Parallel Fast-Forwarding☆33Oct 10, 2024Updated last year
- simd enabled column imprints☆11Feb 12, 2018Updated 8 years ago
- Self-Tuning Adaptive Radix Tree☆30Apr 19, 2020Updated 5 years ago
- Tiered Indexing is a general approach to improve the memory utilization of buffer-managed data structures including B+tree, Hashing, Heap…☆48Jun 21, 2025Updated 8 months ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Sep 4, 2024Updated last year
- ☆16Dec 6, 2014Updated 11 years ago
- Blog of finesse☆13Jun 21, 2016Updated 9 years ago
- wisckey implementation using RocksDB☆12Jan 14, 2023Updated 3 years ago
- A runtime implementation of data-parallel actors.☆39Apr 1, 2022Updated 3 years ago
- ☆39Jun 20, 2020Updated 5 years ago
- ☆12Jun 25, 2021Updated 4 years ago
- HDFS based on Java implementation as a remote ObjectStore for DataFusion☆10Feb 13, 2024Updated 2 years ago
- Shaded version of Apache Hive for Trino☆10Aug 13, 2024Updated last year
- Implementation of a Backpack Quotient Filter☆13Jul 7, 2025Updated 7 months ago
- ☆12Jul 15, 2025Updated 7 months ago
- ☆11Feb 21, 2023Updated 3 years ago
- ☆15Jan 19, 2025Updated last year
- Stream processing engine☆13Apr 7, 2021Updated 4 years ago
- Code used in the paper "On dynamic succinct graph representations".☆11Sep 2, 2021Updated 4 years ago