Alternatives and similar repositories for external_sort

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

• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆34Updated 8 months ago
• ArashPartow / bloom
  C++ Bloom Filter Library https://www.partow.net/programming/bloomfilter/index.html
  ☆141Updated 4 years ago
• cmuparlay / parlaylib
  A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines
  ☆372Updated 4 months ago
• cmuparlay / pbbslib
  ☆25Updated 4 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆118Updated 6 months ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆212Updated last month
• tlx / tlx
  TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers
  ☆431Updated 8 months ago
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆112Updated 8 months ago
• llersch / cpp_random_distributions
  Additional C++11 Random Distributions
  ☆19Updated last year
• voutcn / kxsort
  Fast in-place radix sort with STL-like API
  ☆47Updated 8 years ago
• mavam / libbf
  Bloom filters for C++11
  ☆363Updated 3 years ago
• yaobaiwei / PPA-Assembler
  A toolkit for de novo genome assembly based on Pregel.
  ☆12Updated 5 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• ekg / intervaltree
  a minimal C++ interval tree implementation
  ☆231Updated 4 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆55Updated last year
• ansrlab / edgepart
  Graph edge partitioning algorithms
  ☆47Updated 5 years ago
• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆19Updated 3 years ago
• justinasvd / art_map
  std::map/std::set implementation using the adaptive radix tree
  ☆15Updated 4 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• pabmont / pma
  Packed Memory Array
  ☆17Updated 11 years ago
• refresh-bio / RADULS
  Ultra fast MSD radix sorter
  ☆11Updated 5 years ago
• ECP-ExaGraph / vite
  MPI+OpenMP implementation of Louvain method for Graph Community Detection, with a number of parallel heuristics/approximate computing tec…
  ☆27Updated 2 months ago
• baserinia / parallel-sort
  An efficient C++ multi-threaded sorting function based on C++11 threads
  ☆27Updated 9 years ago
• anikristo / LearnedSort
  Learned Sort: a model-enhanced sorting algorithm
  ☆81Updated 4 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• aronszanto / sLSM-Tree
  High-Performance C++ Data System
  ☆131Updated last month
• cmuparlay / parlayhash
  Concurrent Hash Table
  ☆32Updated last month
• the-data-lab / GraphOne
  "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19
  ☆59Updated 4 years ago
• pkumod / GraphSetIntersection
  Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…
  ☆30Updated 6 years ago
• iHeartGraph / iBFS
  iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16
  ☆25Updated 8 years ago