Alternatives and similar repositories for sqlplot-tools:

Users that are interested in sqlplot-tools are comparing it to the libraries listed below

• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆37Updated last month
• niklas-uhl / katric
  KaTric: scalable distributed-memory triangle counting made in Karlsruhe
  ☆13Updated last year
• kamping-site / kassert
  Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…
  ☆11Updated 2 months ago
• marvinwilliams / multiqueue
  ☆17Updated last month
• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆15Updated 5 years ago
• molaupi / karri
  Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.
  ☆12Updated last week
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 11 months ago
• hu-macsy / dhb
  Dynamic Hashed Blocks (DHB) data structure for dynamic graphs
  ☆12Updated 3 weeks ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• sacabench / sacabench
  Implementation of the sacabench framework
  ☆17Updated 3 years ago
• TooBiased / DySECT
  Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.
  ☆20Updated 2 years ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆94Updated last week
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 7 months ago
• KarlsruheMIS / pace-2019
  Winning Solver of PACE Challenge 2019 Track A
  ☆13Updated 3 years ago
• lorenzhs / ssssort
  Super Scalar Sample Sort in modern C++
  ☆20Updated 4 years ago
• stringologytimes / StringologyTimes
  Paper Collection for Stringologists
  ☆17Updated last week
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆161Updated 3 months ago
• domschrei / mallob
  Malleable Load Balancer. Massively Parallel Logic Backend. Award-winning SAT solving for the cloud.
  ☆66Updated last week
• bingmann / malloc_count
  Method to measure the amount of allocated memory of a program at run-time.
  ☆68Updated 3 years ago
• KaHIP / KaMinPar
  Shared-Memory and Distributed-Memory Parallel Graph Partitioning
  ☆38Updated last week
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆29Updated 2 weeks ago
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆31Updated 3 months ago
• ByteHamster / PaCHash
  Packed and Compressed Hash Tables
  ☆15Updated 2 weeks ago
• mpetri / recursive_graph_bisection
  This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…
  ☆10Updated 6 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• nalinbhardwaj / min-cut-paper
  A Simple Algorithm for Minimum Cuts in Near-Linear Time (SWAT '20)
  ☆12Updated 5 years ago
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated last year
• mpetri / mem_monitor
  A simple C++11 memory monitor
  ☆15Updated 9 years 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…
  ☆109Updated 3 months ago
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆118Updated 3 months ago