Alternatives and similar repositories for skiplist:

Users that are interested in skiplist are comparing it to the libraries listed below

• bytedance / terark-zip
  A data structure and algorithm library built for TerarkDB
  ☆62Updated 2 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆51Updated 10 months ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 7 years ago
• alibaba / hiactor
  Hiactor is a distributed C++ actor framework.
  ☆107Updated 7 months ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• UWHustle / hustle
  In-memory, columnar, arrow-based database.
  ☆44Updated 2 years ago
• Tessil / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆37Updated 3 years ago
• UWQuickstep / quickstep
  Quickstep project
  ☆41Updated 2 months ago
• Legacy25 / ValkyrieDB
  A SQL-to-native-code compiler based on LLVM
  ☆46Updated 9 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 7 years ago
• pfent / L5RDMA
  A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA
  ☆71Updated 4 years ago
• boostorg / boost_unordered_benchmarks
  ☆17Updated 2 months ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆57Updated 6 years ago
• algorithm-ninja / cpp-btree
  Git mirror of the official (mercurial) repository of cpp-btree
  ☆73Updated 10 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆152Updated 9 months ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆28Updated 3 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆51Updated 7 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆130Updated 3 years ago
• harald-lang / tree-encoded-bitmaps
  ☆37Updated 4 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆39Updated this week
• google / hashtable-benchmarks
  ☆104Updated 11 months ago
• chloro-pn / tunnel
  Tunnel is a Pipeline Execution Engine based on C++20 coroutine
  ☆27Updated last year
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆173Updated 8 years ago
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆177Updated 3 months ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• 3rdparty / eventuals-grpc
  C++ asynchronous interface for gRPC based on https://github.com/3rdparty/eventuals.
  ☆20Updated 2 years ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆30Updated 7 months ago
• MengRao / str
  A SIMD optimized fixed-length string class along with an adaptive hash table for fast searching
  ☆127Updated 3 years ago