marcocosta97 / grafiteLinks
Grafite is a data structure that enables fast range emptiness queries using optimal space and time.
☆13Updated 11 months ago
Alternatives and similar repositories for grafite
Users that are interested in grafite are comparing it to the libraries listed below
Sorting:
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 3 months ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- ☆15Updated 9 months ago
- ☆12Updated 3 years ago
- Source code of our implementation of the concurrent RMA☆12Updated 6 years ago
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆14Updated 2 years ago
- simd enabled column imprints☆11Updated 7 years ago
- Code for our paper "Evaluating SIMD Compiler-Intrinsics for Database Systems"☆15Updated 2 years ago
- InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.☆55Updated last year
- Sequential implementation of the Rewired Memory Array.☆19Updated 6 years ago
- ☆30Updated 3 years ago
- Graphs analytics on collections of views!☆36Updated last year
- Reducing the cache misses of SIMD vectorization using IMV☆29Updated 3 years ago
- C++ driver to evaluate updates and analytics on dynamic structural graphs☆27Updated 3 years ago
- ☆74Updated 7 months ago
- Sundial: A distributed OLTP database testbed.☆38Updated 5 years ago
- A C++ library for the analysis of structural dynamic graphs☆27Updated 3 years ago
- Persistent Bloom Filter☆12Updated 7 years ago
- A system that seamlessly integrates Big Data processing and machine learning model serving in distributed relational database☆17Updated last year
- Learned Sort: a model-enhanced sorting algorithm☆81Updated 4 years ago
- ☆15Updated 5 years ago
- Task-based framework for automatic synchronization and memory prefetching.☆18Updated 3 years ago
- SBoost is a SIMD-based C++ library enabling fast filtering and decoding of lightweight encoded data☆11Updated 4 years ago
- Tabular: Efficiently Building Efficient Indexes (VLDB 2025)☆23Updated 7 months ago
- ☆38Updated 5 years ago
- Quickstep project☆43Updated last year
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆68Updated 2 months ago
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆16Updated 5 years ago
- ☆55Updated last year
- Implementation and artifacts for "User-Defined Operators: Efficiently Integrating Custom Algorithms into Modern Databases"☆24Updated last year