Alternatives and similar repositories for semi_index

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

• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• fclaude / libcds
  Compact Data Structures Library
  ☆129Updated 11 years ago
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆116Updated 8 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆53Updated 7 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• bryankate / pequod
  A distributed key-value cache with builtin materialized views.
  ☆25Updated 11 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 7 years ago
• lysevi / nkvdb
  nkvdb - is a numeric time-series database.
  ☆35Updated 8 years ago
• frankmcsherry / dataflow-join
  An implementation of Ngo et al's GenericJoin in timely dataflow.
  ☆91Updated 6 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆85Updated last year
• uwescience / raco
  Compilation and rule-based optimization framework for relational algebra. Raco is the language, optimization, and query translation layer…
  ☆74Updated 7 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 8 years ago
• stasis / stasis
  Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…
  ☆53Updated 12 years ago
• facebookarchive / Rseq
  Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations
  ☆38Updated 6 years ago
• ot / succinct
  A collection of succinct data structures
  ☆211Updated last year
• dhutchis / LaraDB
  A platform for unified linear and relational algebra analytics, built on the Accumulo NoSQL database
  ☆13Updated 3 years ago
• google / redgrep
  ♥ Janusz Brzozowski
  ☆162Updated last year
• splatlab / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆15Updated 7 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• ademakov / MainMemory
  Wannabe Main Memory Database and More
  ☆54Updated 4 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆50Updated last year
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• fanf2 / hg64
  a 64-bit histogram / quantile sketch
  ☆59Updated 10 months ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆17Updated 10 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆120Updated 8 years ago
• AlexKashuba / SQLite_JIT
  ☆28Updated 7 years ago
• ucbrise / fluent-old
  Bloom + C++
  ☆17Updated 8 years ago
• backtrace-labs / stuffed-record-stream
  Backtrace.io's resilient log record framing format
  ☆40Updated 3 years ago
• jarulraj / postgresql-cpp
  C++11 port of the PostgreSQL DBMS
  ☆70Updated 9 years ago