dajjill commented on issue #20435: URL: https://github.com/apache/shardingsphere/issues/20435#issuecomment-1223849871
The implementation is simple. In the memory, the string that needs to be like matched is fully decomposed according to the length of 1~N, N is the length of the string, and then each decomposed group is encrypted and stored in the memory, so that LIKE can be converted into an equivalent value associated. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
