Alternatives and similar repositories for succinct-cpp

Users that are interested in succinct-cpp are comparing it to the libraries listed below

• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated last year
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 7 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• efficient / msls-eval
  Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs
  ☆10Updated 9 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• spcl / vldb19-distributed-locking
  This repository hosts the code used for the following paper: Claude Barthels, Ingo Müller, Konstantin Taranov, Torsten Hoefler, Gustavo A…
  ☆10Updated 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
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 3 years ago
• MorphStore / TVLLib
  Template Vector Library
  ☆18Updated 3 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 8 months ago
• dbis-ilm / pipefabric
  Stream processing engine
  ☆12Updated 4 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 4 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆27Updated last month
• UWQuickstep / quickstep
  Quickstep project
  ☆42Updated 6 months ago
• IntelLabs / pmgd
  Persistent Memory Graph Database
  ☆43Updated 2 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆42Updated 8 years ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆33Updated 2 months 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
  ☆27Updated 5 years ago
• tum-db / cachecoherence
  ☆12Updated 3 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆57Updated 7 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 12 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 8 years ago