improbable-eng / phtree-cpp

Related projects ⓘ

Alternatives and complementary repositories for phtree-cpp

• morton-nd / morton-nd
  A header-only compile-time Morton encoding / decoding library for N dimensions.
  ☆98Updated last year
• virtuald / r-star-tree
  A relatively simple implementation of the R* Tree data structure for C++
  ☆48Updated last year
• omarobeya / parallel-inplace-radixsort
  ☆20Updated 3 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆55Updated 7 years ago
• mloskot / spatial_index_benchmark
  Simple non-academic performance comparison of available open source implementations of R-tree spatial index using linear, quadratic and R…
  ☆46Updated 5 years ago
• aavenel / FastMortonKeys
  Compute morton keys using a look-up table generated at compile-time.
  ☆31Updated 7 years ago
• bmuratshin / zcurve
  Spatial index based on Z&Hilbert curves realized as pgsql extension.
  ☆17Updated 7 years ago
• wjakob / dset
  Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank
  ☆61Updated 9 years ago
• lorenzhs / ssssort
  Super Scalar Sample Sort in modern C++
  ☆20Updated 4 years ago
• owensgroup / MVGpuBTree
  GPU B-Tree with support for versioning (snapshots).
  ☆43Updated 2 weeks ago
• adishavit / hilbert
  Doug Moore's Fast Hilbert Curve Generation, Sorting, and Range Queries
  ☆69Updated 8 years ago
• cmuparlay / parlayhash
  Concurrent Hash Table
  ☆18Updated 2 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…
  ☆106Updated 7 months ago
• DolevAdas / Jiffy
  ☆43Updated 3 years ago
• omidm / nimbus
  nimbus: a cloud computing framework for high performance computations
  ☆24Updated 4 years ago
• rollbear / prio_queue
  C++14 cache friendly B-heap priority queue
  ☆104Updated 3 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆13Updated 2 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆63Updated 3 years ago
• pdziepak / ranges-gpu
  Experimental ranges for CUDA
  ☆25Updated 5 years ago
• tudocomp / compact_sparse_hash
  A blend of the compact and sparse hash table implementations.
  ☆12Updated 3 years ago
• ParAlg / ParGeo
  ☆42Updated 2 years ago
• Wunkolo / qHilbert
  qHilbert is a vectorized speedup of Hilbert curve generation using SIMD intrinsics
  ☆34Updated 5 years ago
• mwarning / SimpleOctree
  A simple and very fast Octree Implementation that supports Nearest Neigbour Search
  ☆29Updated 3 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆40Updated 4 years ago
• glampert / hash_index
  Fast hash table template for array indexes.
  ☆27Updated 7 years ago
• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆82Updated last year
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 6 years ago
• renzibei / fph-table
  Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup
  ☆41Updated last year
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 11 years ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated 7 months ago