maria-developers team mailing list archive

[Roberto Spadim <roberto@xxxxxxxxxxxxx>]

Hi guys, how could i optimize a hash index using like?

i was thinking about something like a index over first left bytes using
hash, example:
field LIKE "abc%"

create index hash_index( field(3) ) using hash

any idea if this could be possible? this could boost some queries here that
i'm using btree

today i'm using the LIKE, but i'm considering a virtual column + a index
over virtual column + a ( AND virtual_column='abc')


any other idea? or maybe optimize the LIKE function
-- 
Roberto Spadim