improbable-eng / phtree-cpp

Related projects ⓘ

Alternatives and complementary repositories for phtree-cpp

• wjakob / dset
  Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank
  ☆61Updated 9 years ago
• morton-nd / morton-nd
  A header-only compile-time Morton encoding / decoding library for N dimensions.
  ☆98Updated last year
• jrd730 / QuadTree
  a dynamic 2d space partitioning tree
  ☆22Updated 3 years ago
• virtuald / r-star-tree
  A relatively simple implementation of the R* Tree data structure for C++
  ☆48Updated last year
• tuxalin / THST
  Templated hierarchical spatial trees designed for high-peformance.
  ☆125Updated 8 months ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 7 years ago
• tzaeschke / phtree-cpp
  PH-Tree C++ implementation
  ☆28Updated last year
• tzaeschke / phtree
  PH-Tree
  ☆122Updated 5 months ago
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆25Updated last year
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆27Updated 3 years ago
• omarobeya / parallel-inplace-radixsort
  ☆20Updated 3 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 8 months ago
• jermp / clustered_elias_fano_indexes
  Clustered Elias-Fano inverted indexes.
  ☆14Updated 6 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆51Updated 7 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 4 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
• harald-lang / tree-encoded-bitmaps
  ☆37Updated 4 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆13Updated 2 years ago
• ParAlg / ParGeo
  ☆42Updated 2 years ago
• michaeljclark / ethical_hashmap
  Fast open addressing hash table
  ☆41Updated 11 months ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆28Updated last year
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 2 months ago
• renzibei / fph-table
  Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup
  ☆41Updated last year
• tzaeschke / tinspin-indexes
  Spatial index library with R*Tree, STR-Tree, Quadtree, CritBit, KD-Tree, CoverTree and PH-Tree
  ☆113Updated 3 months ago
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆38Updated 4 years ago
• amallia / gpu-integers-compression
  GPU-Accelerated Faster Decoding of Integer Lists
  ☆13Updated 5 years ago
• owensgroup / MVGpuBTree
  GPU B-Tree with support for versioning (snapshots).
  ☆44Updated 3 weeks ago
• adishavit / hilbert
  Doug Moore's Fast Hilbert Curve Generation, Sorting, and Range Queries
  ☆69Updated 8 years ago
• ssteinberg / shared_futex
  Fast, shared, upgradeable, non-recursive and non-fair mutex
  ☆29Updated 6 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 11 years ago