Alternatives and similar repositories for bloomfilter-bsd

Users that are interested in bloomfilter-bsd are comparing it to the libraries listed below

• peterboncz / bloomfilter-repro
  ☆30Updated 6 years ago
• t1mm3 / vldb_voila
  Query engine synthesizer based on, our domain-specific language, VOILA
  ☆13Updated 4 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• hpides / autovec-db
  Code for our paper "Evaluating SIMD Compiler-Intrinsics for Database Systems"
  ☆15Updated 2 years ago
• viktorleis / perfevent
  An easy-to-use, header-only C++ wrapper for Linux' perf event API
  ☆138Updated last month
• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆29Updated 3 years ago
• wangziqi2016 / index-microbench
  ☆150Updated 2 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 7 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆106Updated 7 years ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆32Updated 2 years ago
• efficient / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆38Updated 7 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆170Updated 2 months ago
• eyalroz / ssb-dbgen
  Star Schema Benchmark data set generator (dbgen) - unified repository
  ☆39Updated 9 months ago
• wheatman / BP-Tree
  ☆16Updated last year
• wagjamin / inkfuse
  InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.
  ☆55Updated last year
• UWQuickstep / quickstep
  Quickstep project
  ☆44Updated last year
• flode / ARTSynchronized
  ☆125Updated 3 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆158Updated 7 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆57Updated last year
• sfu-dis / tabular
  Tabular: Efficiently Building Efficient Indexes (VLDB 2025)
  ☆23Updated 9 months ago
• epfl-dias / proteus
  Proteus is a database engine (research prototype) designed for today's heterogeneous environments. Proteus adapts to variable data, hardw…
  ☆26Updated 2 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 7 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆196Updated last year
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated 2 years ago
• harald-lang / tree-encoded-bitmaps
  ☆39Updated 5 years ago
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆81Updated 8 years ago
• cwida / rma
  Sequential implementation of the Rewired Memory Array.
  ☆19Updated 6 years ago
• TimoKersten / db-engine-paradigms
  Collection of experiments to carve out the differences between two types of relational query processing engines: Vectorizing (interpretat…
  ☆267Updated 7 years ago
• Erins-Ransom / Proteus
  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
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago