davidmoten/rtree

How to do an incremental knn search?

Open

#163 opened on Nov 30, 2022

View on GitHub
 (5 comments) (0 reactions) (0 assignees)Java (1,038 stars) (209 forks)batch import
help wantedquestion

Description

Incremental knn search save the priority queue in each round generated by knn search if best-first strategy is adopted, and use priority queue saved in the previous round to search knn in the current round. I want to do an incremental knn search. Does anyone can teach me, thank you very much!

Contributor guide

Tech stack
java
Domain
search
Issue type
research
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.
1-3 hours
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.
unclear
Prerequisites
JavaR tree
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
20
Research direction
Check if incremental knn search is already supported in the library. Review the existing documentation and examples. Look at the comments on this issue for any guidance from maintainers. If not supported, consider whether to add a feature request or document how to implement it.