peterboncz / bloomfilter-bsdLinks
based on the work of Harald Lang when at CWI
☆23Updated 5 years ago
Alternatives and similar repositories for bloomfilter-bsd
Users that are interested in bloomfilter-bsd are comparing it to the libraries listed below
Sorting:
- ☆29Updated 5 years ago
- ☆38Updated 5 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- Query engine synthesizer based on, our domain-specific language, VOILA☆13Updated 4 years ago
- Code for our paper "Evaluating SIMD Compiler-Intrinsics for Database Systems"☆14Updated last year
- Reducing the cache misses of SIMD vectorization using IMV☆28Updated 2 years ago
- An adaptive radix tree for efficient indexing in main memory.☆161Updated last year
- ☆15Updated 5 years ago
- ☆54Updated last year
- ☆51Updated 7 months ago
- ☆20Updated 2 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- simd enabled column imprints☆11Updated 7 years ago
- InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.☆48Updated last year
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year
- Quickstep project☆42Updated 7 months ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Star Schema Benchmark data set generator (dbgen) - unified repository☆36Updated last month
- ☆120Updated 3 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Fast Approximate Membership Filters (C++)☆278Updated 5 months ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆25Updated last year
- ☆146Updated 2 years ago
- A library that provides an embeddable, persistent key-value store for fast storage.☆38Updated 6 years ago
- Tabular: Efficiently Building Efficient Indexes (VLDB 2025)☆16Updated 2 months ago
- An open-source BzTree implementation☆92Updated 3 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆30Updated 14 years ago
- pmwcas☆139Updated 2 years ago
- SBoost is a SIMD-based C++ library enabling fast filtering and decoding of lightweight encoded data☆11Updated 3 years ago