Alternatives and similar repositories for phtree-cpp

Users that are interested in phtree-cpp are comparing it to the libraries listed below

• morton-nd / morton-nd
  A header-only compile-time Morton encoding / decoding library for N dimensions.
  ☆107Updated 2 years ago
• virtuald / r-star-tree
  A relatively simple implementation of the R* Tree data structure for C++
  ☆50Updated 2 years ago
• wjakob / dset
  Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank
  ☆66Updated 10 years ago
• owensgroup / MVGpuBTree
  GPU B-Tree with support for versioning (snapshots).
  ☆49Updated 8 months ago
• gerazo / loose_quadtree
  Loose Quadtree (Region Tree) simple C++11 implementation
  ☆66Updated last year
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆110Updated 6 months ago
• LLNL / fpzip
  Lossless compressor of multidimensional floating-point arrays
  ☆115Updated 5 years ago
• tuxalin / THST
  Templated hierarchical spatial trees designed for high-peformance.
  ☆130Updated last year
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• tzaeschke / phtree-cpp
  PH-Tree C++ implementation
  ☆30Updated 4 months ago
• adishavit / hilbert
  Doug Moore's Fast Hilbert Curve Generation, Sorting, and Range Queries
  ☆71Updated 8 years ago
• ssteinberg / shared_futex
  Fast, shared, upgradeable, non-recursive and non-fair mutex
  ☆31Updated 6 years ago
• renzibei / fph-table
  Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup
  ☆44Updated last year
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• ParAlg / ParGeo
  ☆47Updated 2 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆82Updated 2 years ago
• jrd730 / QuadTree
  a dynamic 2d space partitioning tree
  ☆22Updated 4 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆117Updated 4 months ago
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆41Updated 5 years ago
• tugrul512bit / LruClockCache
  A low-latency LRU approximation cache in C++ using CLOCK second-chance algorithm. Multi level cache too. Up to 2.5 billion lookups per se…
  ☆71Updated last year
• omarobeya / parallel-inplace-radixsort
  ☆21Updated 4 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆86Updated 2 years ago
• atoader / HilbertRTree
  Naive Hilbert R-Tree implementation
  ☆30Updated 10 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• nmoehrle / libacc
  Acceleration structure library (BVH-, KD-Tree) with basic parallel construction
  ☆55Updated 6 years ago
• NickStrupat / Aligned
  Memory alignment wrappers, useful for avoiding false sharing
  ☆41Updated 9 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago