marcocosta97 / grafiteLinks
Grafite is a data structure that enables fast range emptiness queries using optimal space and time.
☆13Updated 5 months ago
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.☆13Updated 2 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆10Updated 2 years ago
- ☆13Updated 4 months ago
- Code for our paper "Evaluating SIMD Compiler-Intrinsics for Database Systems"☆14Updated last year
- ☆28Updated 2 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆34Updated 3 months ago
- Reducing the cache misses of SIMD vectorization using IMV☆28Updated 2 years ago
- ☆53Updated last year
- Sequential implementation of the Rewired Memory Array.☆19Updated 6 years ago
- ☆12Updated 3 years ago
- Implementation and artifacts for "User-Defined Operators: Efficiently Integrating Custom Algorithms into Modern Databases"☆23Updated last year
- ☆38Updated 4 years ago
- ☆8Updated 4 years ago
- Source code of our implementation of the concurrent RMA☆12Updated 6 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- ☆11Updated last year
- A library that provides an embeddable, persistent key-value store for fast storage.☆38Updated 6 years ago
- Code for the TCS paper "On the performance of learned data structures" and the ICML paper "Why are learned indexes so effective?"☆19Updated 4 years ago
- C++ driver to evaluate updates and analytics on dynamic structural graphs☆27Updated 3 years ago
- Persistent Bloom Filter☆12Updated 6 years ago
- PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)☆23Updated 2 years ago
- A C++ library for the analysis of structural dynamic graphs☆27Updated 2 years ago
- Model implementation and explorative UI for the paper "Towards Cost-Optimal Query Processing in the Cloud". Slides: https://bit.ly/37ZfeP…☆15Updated last year
- Learned Sort: a model-enhanced sorting algorithm☆81Updated 3 years ago
- Graphs analytics on collections of views!☆35Updated last year
- A read-optimized learned index for unsorted data☆31Updated last year
- Tabular: Efficiently Building Efficient Indexes (VLDB 2025)☆16Updated last month
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆55Updated last month
- ☆70Updated 2 months ago