Grafite is a data structure that enables fast range emptiness queries using optimal space and time.
☆14Dec 9, 2024Updated last year
Alternatives and similar repositories for grafite
Users that are interested in grafite are comparing it to the libraries listed below
Sorting:
- 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
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 3 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated 7 months ago
- ☆16Sep 25, 2023Updated 2 years ago
- Code repository for SNARF☆13Apr 27, 2023Updated 2 years ago
- BC-Tree and Ball-Tree for Point-to-Hyperplane NNS (ICDE 2023)☆17Aug 4, 2023Updated 2 years ago
- ☆19Mar 13, 2016Updated 9 years ago
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Mar 17, 2025Updated 11 months ago
- Succinct data structures in C/C++☆94Oct 7, 2024Updated last year
- PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)☆24Jun 7, 2023Updated 2 years ago
- (Det)erministic deadl(ock) resolution for high-throughput, low-latency, and strongly consistent data stores.☆28May 12, 2025Updated 9 months ago
- ☆28Sep 28, 2022Updated 3 years ago
- AI-Toolkit collecting and implementing the AI modules for a TEACHING application.☆29Jul 17, 2023Updated 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 11 months ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Feb 15, 2025Updated last year
- JSONPath Streaming with Bit-Parallel Fast-Forwarding☆33Oct 10, 2024Updated last year
- ☆39Oct 19, 2023Updated 2 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
- simd enabled column imprints☆11Feb 12, 2018Updated 8 years ago
- Self-Tuning Adaptive Radix Tree☆30Apr 19, 2020Updated 5 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Sep 4, 2024Updated last year
- ☆29Mar 2, 2026Updated last week
- ☆16Dec 6, 2014Updated 11 years ago
- ☆39Jun 20, 2020Updated 5 years ago
- ☆13May 3, 2022Updated 3 years ago
- ☆12Jul 15, 2025Updated 7 months ago
- Implementation of a Backpack Quotient Filter☆13Jul 7, 2025Updated 8 months ago
- ☆12Jun 25, 2021Updated 4 years ago
- ☆13Aug 12, 2020Updated 5 years ago
- BinDex: A Two-Layered Index for Fast and Robust Scans (SIGMOD2020)☆10Jun 5, 2020Updated 5 years ago
- Stream processing engine☆13Apr 7, 2021Updated 4 years ago
- AirIndex: Versatile Index Tuning Through Data and Storage☆10Dec 18, 2024Updated last year
- Course on graph machin learning.☆11Mar 24, 2023Updated 2 years ago
- SQL Optimizations using MLIR☆12Apr 5, 2020Updated 5 years ago
- Generating global explanations from local ones☆11Nov 11, 2022Updated 3 years ago
- ☆11Nov 3, 2021Updated 4 years ago
- A hand-made OS core for National College Students Computer System Ability Competition☆11Aug 28, 2021Updated 4 years ago
- ☆11Feb 21, 2023Updated 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 last month