lucene-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Atri Sharma (JIRA)" <>
Subject [jira] [Commented] (LUCENE-8708) Can we simplify conjunctions of range queries automatically?
Date Thu, 18 Apr 2019 11:55:00 GMT


Atri Sharma commented on LUCENE-8708:

[~ivera] Thanks, that makes sense. I have created an issue for the same:


However, I think that we should still optimize overlapping ranges as this issue proposes so
that existing users also get the performance advantage.


[~jpountz] Any thoughts on how we could simplify the patch?

> Can we simplify conjunctions of range queries automatically?
> ------------------------------------------------------------
>                 Key: LUCENE-8708
>                 URL:
>             Project: Lucene - Core
>          Issue Type: Improvement
>            Reporter: Adrien Grand
>            Priority: Minor
>         Attachments: interval_range_clauses_merging0704.patch
> BooleanQuery#rewrite already has some logic to make queries more efficient, such as deduplicating
filters or rewriting boolean queries that wrap a single positive clause to that clause.
> It would be nice to also simplify conjunctions of range queries, so that eg. {{foo: [5
TO *] AND foo:[* TO 20]}} would be rewritten to {{foo:[5 TO 20]}}. When constructing queries
manually or via the classic query parser, it feels unnecessary as this is something that the
user can fix easily. However if you want to implement a query parser that only allows specifying
one bound at once, such as Gmail ({{after:2018-12-31}}
or GitHub ({{updated:>=2018-12-31}}
then you might end up with inefficient queries if the end user specifies both an upper and
a lower bound. It would be nice if we optimized those automatically.

This message was sent by Atlassian JIRA

To unsubscribe, e-mail:
For additional commands, e-mail:

View raw message