[
https://issues.apache.org/jira/browse/LUCENE-10275?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17452249#comment-17452249
]
ASF subversion and git services commented on LUCENE-10275:
----------------------------------------------------------
Commit a580e29539ff3922901661145980e5b27892e553 in lucene's branch
refs/heads/branch_9x from Ignacio Vera
[ https://gitbox.apache.org/repos/asf?p=lucene.git;h=a580e29 ]
LUCENE-10275: Speed up MultiRangeQuery by using an interval tree
> Use interval tree in MultiRangeQuery
> ------------------------------------
>
> Key: LUCENE-10275
> URL: https://issues.apache.org/jira/browse/LUCENE-10275
> Project: Lucene - Core
> Issue Type: Improvement
> Reporter: Ignacio Vera
> Priority: Major
> Time Spent: 20m
> Remaining Estimate: 0h
>
> Currently MultiRangeQuery uses a naive approach that is iterating over a list
> of clauses to compute relationships between the list of ranges and the kd
> tree. This clearly does not scale for a large number of clauses.
> This problem has already been solved in geo (see
> [https://github.com/apache/lucene/blob/main/lucene/core/src/java/org/apache/lucene/geo/ComponentTree.java)].
> I think it should be easy to make a version of the interval tree for the
> n-dimensional case.
>
--
This message was sent by Atlassian Jira
(v8.20.1#820001)
---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org
For additional commands, e-mail: issues-h...@lucene.apache.org
