davidmoten/rtree

Add support for Hilbert packing (bulk load)

Open

#74 opened on Jan 11, 2018

View on GitHub
 (0 comments) (0 reactions) (0 assignees)Java (1,038 stars) (209 forks)batch import
enhancementhelp wanted

Description

I am dealing with quite large data set (~22M) and this data is static in nature. While I do not care much on insert performance, I would like to improve RTree structure resulting into search efficiencies. For this, I would like to introduce Hilbert packing in parallel to STR packing which was recently put in place. Based upon data compositions, shape and distribution one packing algo. may perform better than the other. More importantly, its quite straight forward.

Contributor guide

Tech stack
java
Domain
databaseperformance
Issue type
feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
3
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
half day
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
stale
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
clear
Prerequisites
JavaR treeHilbert curveBulk loading
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
40
Research direction
First, locate the existing STR packing implementation in the repository (likely in the 'rtree' source folder). Study how the packing method is integrated. Then, implement a new packing method using Hilbert curves. There is no linked PR or additional comments, so the approach is to follow the pattern of STR packing. Ensure to handle the Hilbert curve calculation and provide appropriate documentation.
Add support for Hilbert packing (bulk load) · davidmoten/rtree#74 | Good First Issue