AMDComputeLibraries / morton_filter

Related projects: ⓘ

• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆32Updated last year
• wuwuz / Vacuum-Filter
  ☆48Updated 4 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆26Updated 3 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆138Updated 6 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆50Updated 4 months ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆46Updated 2 years ago
• caetanosauer / fineline-zero
  ☆12Updated 5 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆40Updated 2 weeks ago
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 6 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆37Updated 2 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆50Updated 7 years ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆124Updated last year
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆146Updated 2 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆26Updated 4 years ago
• LPD-EPFL / flodb
  A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.
  ☆26Updated 7 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆44Updated 2 years ago
• harald-lang / tree-encoded-bitmaps
  ☆36Updated 4 years ago
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 4 years ago
• tuhhosg / exmap
  ☆36Updated 5 months ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆36Updated last week
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆38Updated 4 years ago
• lemire / dictionary
  High-performance dictionary coding
  ☆102Updated 7 years ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆76Updated 2 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆37Updated 3 years ago
• arif-arman / origami-sort
  Implementation of Origami: A High-Performance Mergesort Framework
  ☆26Updated last year
• microsoft / pmwcas
  pmwcas
  ☆135Updated last year
• vedantk / quotient-filter
  a quotient filter written in C
  ☆83Updated 7 years ago
• L-v-M / async
  ☆20Updated last year
• cruzdb / cruzdb
  Append-only key-value database on a distributed shared-log
  ☆49Updated last month
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆168Updated 8 years ago