harald-lang / tree-encoded-bitmaps
☆38Updated 4 years ago
Alternatives and similar repositories for tree-encoded-bitmaps:
Users that are interested in tree-encoded-bitmaps are comparing it to the libraries listed below
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- Quickstep project☆42Updated 5 months ago
- based on the work of Harald Lang when at CWI☆23Updated 5 years ago
- ☆53Updated 11 months ago
- InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.☆47Updated 11 months ago
- ☆29Updated 5 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 3 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- A read-optimized learned index for unsorted data☆31Updated last year
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆53Updated this week
- An open-source BzTree implementation☆92Updated 3 years ago
- Sequential implementation of the Rewired Memory Array.☆19Updated 5 years ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆25Updated last year
- ☆12Updated 6 years ago
- ☆20Updated 2 years ago
- Query engine synthesizer based on, our domain-specific language, VOILA☆13Updated 4 years ago
- ☆12Updated 3 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆10Updated 2 years ago
- A C++ library for the analysis of structural dynamic graphs☆27Updated 2 years ago
- Source code of our implementation of the concurrent RMA☆12Updated 5 years ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆57Updated 2 weeks ago
- ☆45Updated last year
- ☆15Updated 5 years ago
- C++ driver to evaluate updates and analytics on dynamic structural graphs☆27Updated 3 years ago
- ☆66Updated last month
- A Database System for Research and Fast Prototyping☆102Updated last month
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- Implementation and artifacts for "User-Defined Operators: Efficiently Integrating Custom Algorithms into Modern Databases"☆23Updated last year
- ☆50Updated 5 months ago