On 12 May 2014, at 3:05pm, Constantine Yannakopoulos wrote: > I understand that it is difficult to find the least greater character of a > given character if you are unaware of the inner workings of a collation, > but maybe finding a consistent upper limit for all characters in all > possible collations is not impossible?
I agree: it's not possible to deduce an optimization without understanding the collation. It might be possible to introduce it in a future version of SQLite by requiring anyone who writes an optimization to supply routines which work out the proper strings for comparison. However, I don't think it's necessary to solve this problem. Just don't try to optimize it. Whoever is doing the programming knows that pattern matching is slow. If they want a fast solution they'll use BETWEEN instead. And that will make them have to provide their own comparison strings. Simon. _______________________________________________ sqlite-users mailing list sqlite-users@sqlite.org http://sqlite.org:8080/cgi-bin/mailman/listinfo/sqlite-users
