Alternatives and similar repositories for sqlplot-tools:

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

• 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
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆36Updated 3 weeks ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• niklas-uhl / katric
  KaTric: scalable distributed-memory triangle counting made in Karlsruhe
  ☆13Updated last year
• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆15Updated 4 years ago
• marvinwilliams / multiqueue
  ☆17Updated last week
• 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
• hu-macsy / dhb
  Dynamic Hashed Blocks (DHB) data structure for dynamic graphs
  ☆12Updated 2 months ago
• KaHIP / KaMinPar
  Shared-Memory and Distributed-Memory Parallel Graph Partitioning
  ☆39Updated this week
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆94Updated 4 months ago
• sacabench / sacabench
  Implementation of the sacabench framework
  ☆15Updated 3 years ago
• KarlsruheMIS / pace-2019
  Winning Solver of PACE Challenge 2019 Track A
  ☆13Updated 3 years ago
• ByteHamster / PaCHash
  Packed and Compressed Hash Tables
  ☆15Updated last year
• lorenzhs / ssssort
  Super Scalar Sample Sort in modern C++
  ☆20Updated 4 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 4 months ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 7 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 8 months ago
• bingmann / malloc_count
  Method to measure the amount of allocated memory of a program at run-time.
  ☆67Updated 2 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆25Updated last month
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆27Updated 2 months ago
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆161Updated 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
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆30Updated 2 weeks ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• kamping-site / kamping
  KaMPIng: (Near) zero-overhead MPI wrapper for modern C++
  ☆44Updated last week
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆40Updated last month
• larsgottesbueren / gp-ann
  Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"
  ☆23Updated 2 months ago
• andralex / MedianOfNinthers
  ☆49Updated 4 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…
  ☆107Updated last month