Alternatives and similar repositories for origami-sort:

Users that are interested in origami-sort are comparing it to the libraries listed below

• wuwuz / Vacuum-Filter
  ☆50Updated last month
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated last year
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆130Updated 3 years ago
• harald-lang / tree-encoded-bitmaps
  ☆37Updated 4 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆28Updated 3 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆52Updated 8 months ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆152Updated 9 months ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• microsoft / pmwcas
  pmwcas
  ☆135Updated last year
• efficient / HOPE
  Order-preserving key encoder
  ☆122Updated 4 years ago
• peterboncz / bloomfilter-repro
  ☆23Updated 5 years ago
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 6 years ago
• tuhhosg / exmap
  ☆39Updated 9 months ago
• splatlab / vqf
  A fast approximate membership query data structure
  ☆11Updated 6 months ago
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆85Updated 4 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 4 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆40Updated last month
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆90Updated 3 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 4 months ago
• wangziqi2016 / index-microbench
  ☆142Updated last year
• bytedance / terark-zip
  A data structure and algorithm library built for TerarkDB
  ☆62Updated 2 years ago
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆248Updated 3 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆140Updated 6 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆99Updated 8 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆173Updated 8 years ago
• peterboncz / bloomfilter-bsd
  based on the work of Harald Lang when at CWI
  ☆23Updated 4 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆87Updated 2 years ago
• UCHI-DB / sboost
  SBoost is a SIMD-based C++ library enabling fast filtering and decoding of lightweight encoded data
  ☆11Updated 3 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 7 years ago