[
https://issues.apache.org/jira/browse/PHOENIX-1291?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17517135#comment-17517135
]
ASF GitHub Bot commented on PHOENIX-1291:
-----------------------------------------
Rodolffo opened a new pull request, #1412:
URL: https://github.com/apache/phoenix/pull/1412
For optimizing the ILIKE queries, during the optimization phase, a set of
ranges (2^n to be precise) are created for limiting results, if the pattern
starts with a string literal, as such:
'abc%' will generate 'abc', 'Abc', 'aBc', 'abC', 'ABc', 'AbC', 'aBC', and
'ABC'.
I'm not completely sure if this solution is valid, and I'd like to do a few
performance tests on how it performs which I'll share here, but in the
meanwhile I'd appreaciate any feedback and suggestions. I mostly followed James
Taylor's comments and the discussion in
https://issues.apache.org/jira/browse/PHOENIX-1273, which the original ticket
refers to.
> Optimize ILIKE by determining possible key ranges for initial literal part of
> pattern
> -------------------------------------------------------------------------------------
>
> Key: PHOENIX-1291
> URL: https://issues.apache.org/jira/browse/PHOENIX-1291
> Project: Phoenix
> Issue Type: Bug
> Reporter: James R. Taylor
> Priority: Major
>
> See PHOENIX-1273 and the WhereOptimizer.visitLeave(LikeExpression node)
> method.
--
This message was sent by Atlassian Jira
(v8.20.1#820001)
