Alternatives and similar repositories for HilbertRTree

Users that are interested in HilbertRTree are comparing it to the libraries listed below

• virtuald / r-star-tree
  A relatively simple implementation of the R* Tree data structure for C++
  ☆51Updated 2 years 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
• thomasmoelhave / tpie
  Templated Portable I/O Environment
  ☆113Updated 4 months ago
• improbable-eng / phtree-cpp
  PH-Tree C++ implementation by Improbable.
  ☆23Updated 2 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…
  ☆48Updated 6 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• cchatzis / Nearest-Neighbour-LSH
  C++ program that, given a vectorised dataset and query set, performs locality sensitive hashing, finding either Nearest Neighbour (NN) or…
  ☆11Updated 4 years ago
• tstarling / thread-safe-lru
  A C++ template class providing a thread-safe LRU cache
  ☆76Updated 3 years ago
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆81Updated 7 years ago
• jckarter / tbb
  Intel Threading Building Blocks with local modifications
  ☆30Updated 13 years ago
• Kronuz / cpp-btree
  Modern C++ B-tree containers
  ☆275Updated 2 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆54Updated last year
• Liuguanli / RSMI
  A Recursive Spatial Model Index
  ☆38Updated last year
• omarobeya / parallel-inplace-radixsort
  ☆21Updated 4 years ago
• pfl-cs / LISA
  ☆40Updated 4 years ago
• ArashPartow / bloom
  C++ Bloom Filter Library https://www.partow.net/programming/bloomfilter/index.html
  ☆141Updated 4 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• petegoodliffe / skip_list
  STL-style C++ skip_list container
  ☆87Updated 3 years ago
• tuxalin / THST
  Templated hierarchical spatial trees designed for high-peformance.
  ☆130Updated last year
• Lucaweihs / range-tree
  A C++ RangeTree implementation.
  ☆43Updated 5 years ago
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 10 years ago
• beniz / fiboheap
  C++ STL-like Fibonacci heap and queue for fast priority queues with mutable keys.
  ☆68Updated 3 years ago
• Menooker / Dogee
  C++ distributed platform for shared memory programming
  ☆25Updated 4 years ago
• davidmoten / hilbert-curve
  Java utilities for transforming distance along N-dimensional Hilbert Curve to a point and back. Also supports range splitting queries on …
  ☆119Updated last week
• nvmd / libkdtree
  libkdtree++ is an STL-like C++ template container implementation of k-dimensional space sorting, using a kd-tree. It sports a theoretical…
  ☆72Updated 6 months ago
• Fdhvdu / ThreadPool
  A fastest, exception-safety and pure C++17 thread pool.
  ☆131Updated 6 years ago
• ZJULearning / efanna_graph
  an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework
  ☆96Updated 5 years ago
• genbattle / dkm
  A generic C++11 k-means clustering implementation
  ☆211Updated 4 months ago
• amgt-d1 / DPC
  Daichi Amagata and Takahiro Hara, SIGMOD2021
  ☆14Updated last year