Naive Hilbert R-Tree implementation
☆30Jan 31, 2015Updated 11 years ago
Alternatives and similar repositories for HilbertRTree
Users that are interested in HilbertRTree are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Doug Moore's Fast Hilbert Curve Generation, Sorting, and Range Queries☆71Jul 30, 2016Updated 10 years ago
- ☆42May 22, 2021Updated 5 years ago
- Binary to Hilbert converter☆18Feb 10, 2021Updated 5 years ago
- A lightweight learned index for spatial range queries on complex geometries☆14Sep 6, 2022Updated 4 years ago
- Learned Spatial Indexes☆11Jan 6, 2025Updated last year
- Wordpress hosting with auto-scaling - Free Trial Offer • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- Artifact of paper "Exploiting Recent SIMD Architectural Advances for Irregular Applications"☆11Jun 23, 2016Updated 10 years ago
- FITing Tree is an indexing data structure that efficiently uses the memory without sacrificing the performance. For the paper: https://dl…☆14Nov 21, 2021Updated 4 years ago
- Code for the TCS paper "On the performance of learned data structures" and the ICML paper "Why are learned indexes so effective?"☆21May 9, 2021Updated 5 years ago
- Source code for Pivot Selection Algorithms in Metric Spaces: An Experimental Evaluation. VLDBJ 2021.☆15Jul 27, 2021Updated 5 years ago
- qHilbert is a vectorized speedup of Hilbert curve generation using SIMD intrinsics☆38Dec 31, 2018Updated 7 years ago
- A Learned Index for Log-Structured Merge Trees☆48Sep 6, 2023Updated 3 years ago
- Fast Hilbert Curves☆82Sep 18, 2016Updated 10 years ago
- ☆11Aug 5, 2024Updated 2 years ago
- N-dimensional RTree implementation in C++☆449Mar 16, 2025Updated last year
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- Simple proof of concept implementation☆10Jan 14, 2021Updated 5 years ago
- A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"☆81Jan 8, 2018Updated 8 years ago
- Error-bounded piecewise linear regression☆29Oct 25, 2025Updated last year
- [TMC 2020;SIGSPATIAL 2019] DeepMM: Deep learning based map matching with data augmentation☆12Jan 16, 2025Updated last year
- PostgreSQL custom aggregate greatest running total implemented in PL/pgSQL and C☆16Feb 10, 2016Updated 10 years ago
- Use CUDA intrinsics with user-defined types☆48Aug 14, 2014Updated 12 years ago
- Open-source CS:GO Zombie Survival game mode with SourcePawn, MySQL persistence, progression systems, and server tooling.☆11Jun 30, 2026Updated 4 months ago
- 基于B+树的磁盘索引☆12Aug 20, 2020Updated 6 years ago
- Learning to Index for Nearest Neighbor Search☆11Jan 18, 2022Updated 4 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Pre-release of SHOC for Intel Xeon Phi☆23Sep 1, 2015Updated 11 years ago
- This is the open codebase for VLDB23: Towards Designing and Learning Piecewise Space-Filling Curves☆11May 19, 2023Updated 3 years ago
- 2020 江西省信息技术知识竞赛题库 在线练习/答题☆13Oct 30, 2020Updated 6 years ago
- gRPC examples in C++11☆11Aug 1, 2017Updated 9 years ago
- Implement the Douglas-Peucker algorithm to compress trajectories.☆11Sep 10, 2015Updated 11 years ago
- Download tiles from OSM tileservers☆12May 18, 2021Updated 5 years ago
- Datadog APM client for C++☆19Updated this week
- Visual Hash for matching copies of visually similar images.☆16Mar 17, 2025Updated last year
- Hybrid Spatial Data Structure based on Quad Tree, R Tree and KD Tree for insertion, search and finding the nearest neighbours on a 2D pla…☆23Apr 28, 2022Updated 4 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- ☆14Sep 22, 2019Updated 7 years ago
- Compute morton keys using a look-up table generated at compile-time.☆31Dec 21, 2016Updated 9 years ago
- Simple example that demonstrates partial mapping of OpenSHMEM over libfabric☆11Jun 16, 2015Updated 11 years ago
- Code for Semi-crowdsourced Clustering with Deep Generative Models☆12Dec 9, 2022Updated 3 years ago
- Convolutional Embedded Networks for Population Scale Clustering and Bio-ancestry Inferencing☆11Jan 7, 2020Updated 6 years ago
- A simple example of how to organize a C/C++ project that uses Buck build☆11Feb 13, 2019Updated 7 years ago
- A TensorFlow implementation on Deep Clustering Network(DCN), ICML 2017☆13Oct 21, 2022Updated 4 years ago
Are these results useful?