davidmoten / davidmoten/rtree

How to do an incremental knn search?

Open
#163 5 comments 0 reactions 0 assignees View on GitHub
help wanted question
Dominant language
Java
Stars
1.1k
Forks
218
Avg merge
2m
Merged PRs (30d)
1

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

No contributing guide indexed for this repository

Research direction

No files, tests, or entry points are identified. Start by locating the repository's existing KNN-search API and its tests, then determine whether incremental reuse is supported; done requires a maintainer-confirmed implementation or documented usage path.

Written by the indexing model from the issue text.

Assessment

Tech stack
java
Domain
search
Issue type
Feature
Difficulty
5/5
Estimated time
Over a week
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
20/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.