Alternatives and similar repositories for extsort

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

• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 7 years ago
• lvv / lvvlib
  C++ utility library
  ☆24Updated 12 years ago
• siganakis / tny
  Tiny data structures that pack a punch!
  ☆101Updated 13 years ago
• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆139Updated 11 months ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 10 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 10 years ago
• larroy / mycelium
  An open source information retrieval system written in C++11 and Python. Aspires to be an alternative to Nutch / Lucene. It uses MongoDB …
  ☆87Updated 2 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• cdacamar / trie
  a series of trie testing things
  ☆21Updated 8 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆121Updated 8 years ago
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆16Updated 9 years ago
• lvv / scc
  Simple-C++
  ☆63Updated 9 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
• zeevt / csnappy
  Google snappy in C for Linux Kernel
  ☆39Updated 3 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 9 years ago
• willemt / bmon
  Batch Monitor - Gain performance by combining work from multiple threads into a single batch
  ☆30Updated 10 years ago
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆116Updated 8 years ago
• rescrv / e
  Library containing high-performance datastructures and utilities for C++
  ☆75Updated 8 years ago
• warriorguo / zertcore5
  C++11 Server framework provides many exciting features!
  ☆52Updated 10 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated 2 years ago
• lysevi / nkvdb
  nkvdb - is a numeric time-series database.
  ☆35Updated 8 years ago
• facebookarchive / iterlib
  Iterator library.
  ☆80Updated 6 years ago
• ned14 / nedtries
  A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit f…
  ☆276Updated 4 years ago
• AlexKashuba / SQLite_JIT
  ☆28Updated 7 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.
  ☆44Updated 9 years ago
• ademakov / Evenk
  A C++ library for concurrent programming
  ☆71Updated 4 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆24Updated 5 years ago
• daniel-j-h / DistributedSearch
  Distributed search engine in C++14, using nanomsg for communication, bond for serialization.
  ☆67Updated 10 years ago
• matovitch / cosche
  A dependency-based coroutine scheduler
  ☆45Updated 9 years ago