nivdayan / FilterLibrary

Related projects ⓘ

Alternatives and complementary repositories for FilterLibrary

• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆31Updated last year
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 4 years ago
• thu-pacman / LiveGraph
  LiveGraph: a transactional graph storage system with purely sequential adjacency list scans
  ☆50Updated 3 years ago
• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆27Updated 2 years ago
• efficient / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆38Updated 5 years ago
• tum-db / user-defined-operators
  Implementation and artifacts for "User-Defined Operators: Efficiently Integrating Custom Algorithms into Modern Databases"
  ☆22Updated 8 months ago
• baotonglu / apex
  High Performance Learned Index on Persistent Memory
  ☆46Updated last year
• njulands / HashAdaptiveBF
  ☆15Updated 3 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆51Updated 5 months ago
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆73Updated 2 years ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆112Updated last year
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆37Updated 4 years ago
• harald-lang / tree-encoded-bitmaps
  ☆37Updated 4 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 5 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.
  ☆11Updated last year
• sfu-dis / ssd-vs-pm
  Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)
  ☆35Updated 2 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆140Updated 6 years ago
• cwida / gfe_driver
  C++ driver to evaluate updates in dynamic structural graphs
  ☆16Updated 2 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆87Updated last year
• DominikHorn / hashing-benchmark
  benchmark driver for "Can Learned Models Replace Hash Functions?" VLDB submission
  ☆16Updated last year
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆28Updated 6 years ago
• cloud-olap / FlexPushdownDB
  ☆71Updated 4 months ago
• zxjcarrot / spitfire
  Source code for Spitfire: A Three-Tier Buffer Manager for Volatile and Non-Volatile Memory
  ☆36Updated last year
• flode / ARTSynchronized
  ☆115Updated 2 years ago
• CGCL-codes / DCF
  Dynamic Cuckoo Filter (DCF) is succinct data structure of approximate set representing and membership testing for large-scale dynamic dat…
  ☆39Updated 6 years ago
• peterboncz / bloomfilter-repro
  ☆19Updated 5 years ago
• dsg-uwaterloo / graphsurge
  Graphs analytics on collections of views!
  ☆34Updated 11 months ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆87Updated last year
• sfu-dis / tesseract
  Tesseract: Efficient Online Schema Evolution for Snapshot Databases (VLDB 2023)
  ☆21Updated last year
• Henning1 / dogqc
  A query compiler for GPUs that translates relational algebra to Cuda.
  ☆21Updated 10 months ago
• zxjcarrot / 2-Tree
  Tiered Indexing is a general way to improve the memory utilization of buffer-managed data structures including B+tree, Hashing, Heap, and…
  ☆26Updated 6 months ago