mloskot / spatial_index_benchmarkLinks
Simple non-academic performance comparison of available open source implementations of R-tree spatial index using linear, quadratic and R* balancing algorithms as well as bulk loading.
☆49Updated 6 years ago
Alternatives and similar repositories for spatial_index_benchmark
Users that are interested in spatial_index_benchmark are comparing it to the libraries listed below
Sorting:
- Templated Portable I/O Environment☆115Updated 9 months ago
- N-dimensional RTree implementation in C++☆433Updated 10 months ago
- C++ implementation of R*-tree, an MVR-tree and a TPR-tree with C API☆773Updated last week
- C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…☆78Updated 5 years ago
- C++ STL-like Fibonacci heap and queue for fast priority queues with mutable keys.☆68Updated 3 years ago
- C++ geometry types☆101Updated last year
- STXXL: Standard Template Library for Extra Large Data Sets☆496Updated 2 years ago
- A generic C++11 k-means clustering implementation☆216Updated 9 months ago
- A relatively simple implementation of the R* Tree data structure for C++☆51Updated 3 years ago
- A header-only compile-time Morton encoding / decoding library for N dimensions.☆114Updated 2 years ago
- Naive Hilbert R-Tree implementation☆31Updated 10 years ago
- Minimalist protocol buffer decoder and encoder in C++☆367Updated 3 months ago
- A C++ library to compress and intersect sorted lists of integers using SIMD instructions☆442Updated 6 months ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- A C++14 library for converting GeoJSON into geometry.hpp representation☆71Updated 3 years ago
- Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank☆67Updated 10 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆117Updated last year
- Efficient Prefix-Sum data structures in C++.☆26Updated 2 years ago
- A well-documented C++ implementation of the cover tree datastructure for quick k-nearest-neighbor search. Allows single-point insertion a…☆64Updated 7 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- libkdtree++ is an STL-like C++ template container implementation of k-dimensional space sorting, using a kd-tree. It sports a theoretical…☆74Updated 3 months ago
- Transpose: SIMD Integer+Floating Point Compression Filter☆63Updated 6 years ago
- GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org☆137Updated 2 years ago
- 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
- C++ implementation of a fast and memory efficient hash map and hash set specialized for strings☆185Updated 2 months ago
- C++ implementation of concurrent Binary Search Trees☆72Updated 10 years ago
- Boost.org graph module☆369Updated last month
- Comprehensive benchmarks of C++ maps☆316Updated 2 years ago
- Fast Hilbert Curves☆81Updated 9 years ago
- A feature complete LRU cache implementation in C++☆262Updated 6 years ago