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
- ☆14Feb 15, 2024Updated 2 years ago
- HDFS based on Java implementation as a remote ObjectStore for DataFusion☆10Feb 13, 2024Updated 2 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated this week
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated 7 months ago
- Compact Tree Representation☆16Mar 16, 2017Updated 9 years ago
- 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
- String map implementation through Fast Succinct Trie☆23Jul 9, 2021Updated 4 years ago
- 北理工成绩更新查询&&计算加权☆11Jul 28, 2024Updated last year
- wisckey implementation using RocksDB☆12Jan 14, 2023Updated 3 years ago
- Shaded version of Apache Hive for Trino☆10Aug 13, 2024Updated last year
- ☆27May 27, 2022Updated 3 years ago
- An SLA-Oriented LSM-Tree Key-Value Store for High-end Cloud Data Service☆17Jan 24, 2021Updated 5 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Jun 16, 2025Updated 9 months ago
- lsm-tree with buffered merge☆12Jan 10, 2022Updated 4 years ago
- Succinct C++☆24Sep 13, 2020Updated 5 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆103Mar 30, 2023Updated 2 years ago
- A runtime implementation of data-parallel actors.☆39Apr 1, 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
- ☆15Jan 19, 2025Updated last year
- 知乎文章附带代码☆15Jan 26, 2023Updated 3 years ago
- FST (Fast Succinct Trie) implementation in Rust☆26May 9, 2019Updated 6 years ago
- [MSST '24] Prophet: Optimizing LSM-Based Key-Value Store on ZNS SSDs with File Lifetime Prediction and Compaction Compensation.☆15Apr 20, 2024Updated last year
- BC-Tree and Ball-Tree for Point-to-Hyperplane NNS (ICDE 2023)☆17Aug 4, 2023Updated 2 years ago
- DockerFinder permits searching for images based on multiple attributes.☆11Jul 10, 2018Updated 7 years ago
- The first range filter to simultaneously offer dynamicity, fast operations, and a robust false positive rate for any workload.☆12Jul 15, 2025Updated 8 months 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 9 months ago
- Code for "Building an Efficient Key-Value Store in a Flexible Address Space" (EuroSys '22)☆23Mar 17, 2025Updated last year
- A plugin-based, multi-threaded "reverse shell" written in python 3.☆10Aug 27, 2018Updated 7 years ago
- Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.☆52Dec 15, 2021Updated 4 years ago
- ☆12Jul 15, 2025Updated 8 months ago
- Key Value Store based on LevelDB☆117Oct 17, 2021Updated 4 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 11 months ago
- Blog of finesse☆13Jun 21, 2016Updated 9 years ago
- R-Index-F Library for Pattern Matching☆12Aug 8, 2024Updated last year
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Sep 4, 2024Updated last year
- (Det)erministic deadl(ock) resolution for high-throughput, low-latency, and strongly consistent data stores.☆28May 12, 2025Updated 10 months ago
- Order-preserving key encoder☆127Apr 28, 2020Updated 5 years ago