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 6 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• lvv / lvvlib
  C++ utility library
  ☆24Updated 11 years ago
• siganakis / tny
  Tiny data structures that pack a punch!
  ☆101Updated 13 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
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆108Updated 8 years ago
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆116Updated 8 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
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆16Updated 8 years ago
• hnsl / librcd
  A library for Rapid {C|Concurrency|Correct} Development
  ☆34Updated 10 years ago
• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆139Updated 9 months ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• jakogut / tinybloom
  A small, simple, easy to use bloom filter written in C.
  ☆35Updated 14 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
• facebookarchive / iterlib
  Iterator library.
  ☆80Updated 5 years ago
• lvv / scc
  Simple-C++
  ☆63Updated 9 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• abau / cppsat
  Propositional Encodings in C++11
  ☆18Updated 7 years ago
• preshing / CompareIntegerMaps
  Generates benchmark data for two different data structures, then renders some graphs.
  ☆112Updated 6 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• lysevi / nkvdb
  nkvdb - is a numeric time-series database.
  ☆35Updated 8 years ago
• skaphan / stmmap
  STM (Software Transactional Memory) implementation in C, based on memory-mapping.
  ☆60Updated 15 years ago
• dankamongmen / libtorque
  A threaded, continuations-based I/O event library for manycore NUMA machines
  ☆73Updated 4 years ago
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 10 years ago
• ademakov / Evenk
  A C++ library for concurrent programming
  ☆71Updated 4 years ago
• daniel-j-h / DistributedSearch
  Distributed search engine in C++14, using nanomsg for communication, bond for serialization.
  ☆67Updated 10 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 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…
  ☆275Updated 4 years ago
• jedisct1 / Pincaster
  A fast persistent nosql database with a HTTP/JSON interface, not only for geographical data.
  ☆171Updated last month
• warriorguo / zertcore5
  C++11 Server framework provides many exciting features!
  ☆52Updated 9 years ago