Alternatives and similar repositories for phtree-cpp

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

• wjakob / dset
  Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank
  ☆65Updated 9 years ago
• morton-nd / morton-nd
  A header-only compile-time Morton encoding / decoding library for N dimensions.
  ☆104Updated 2 years ago
• owensgroup / MVGpuBTree
  GPU B-Tree with support for versioning (snapshots).
  ☆48Updated 8 months ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• virtuald / r-star-tree
  A relatively simple implementation of the R* Tree data structure for C++
  ☆50Updated 2 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• omarobeya / parallel-inplace-radixsort
  ☆21Updated 4 years ago
• owensgroup / GpuBTree
  Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019
  ☆56Updated 3 years ago
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆41Updated 5 years ago
• andybbruno / TSXor
  TSXor: A Simple Time Series Compression Algorithm
  ☆53Updated 4 months ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 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…
  ☆110Updated 5 months ago
• KevinStern / index-cpp
  C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…
  ☆77Updated 4 years ago
• tuxalin / THST
  Templated hierarchical spatial trees designed for high-peformance.
  ☆130Updated last year
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• tzaeschke / phtree-cpp
  PH-Tree C++ implementation
  ☆30Updated 3 months ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• adishavit / hilbert
  Doug Moore's Fast Hilbert Curve Generation, Sorting, and Range Queries
  ☆71Updated 8 years ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆80Updated 3 years ago
• amallia / gpu-integers-compression
  GPU-Accelerated Faster Decoding of Integer Lists
  ☆13Updated 5 years ago
• hadeaninc / libzinc
  Zinc is a C++ library for spatial processing.
  ☆49Updated 6 years ago
• ssteinberg / shared_futex
  Fast, shared, upgradeable, non-recursive and non-fair mutex
  ☆31Updated 6 years ago
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆26Updated last year
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆30Updated 2 months ago
• cmuparlay / flock
  Library for lock-free locks
  ☆82Updated 2 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 5 years ago
• cmuparlay / parlayhash
  Concurrent Hash Table
  ☆27Updated 2 months ago
• jermp / clustered_elias_fano_indexes
  Clustered Elias-Fano inverted indexes.
  ☆15Updated 7 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 3 years ago