Oh of course, that makes sense. I suppose that means querying on REAL indexes should be slower than querying on INTEGER indexes, in the current SQLite3 implementation? Has a benchmark of this ever been done?
> On Apr 3, 2019, at 5:29 PM, Richard Hipp <d...@sqlite.org> wrote: > > On 4/3/19, Joshua Wise <joshuathomasw...@gmail.com> wrote: >> From my naive understanding, memcmp() is used to efficiently compare long >> strings of bytes. But where in SQLite3 is it necessary to compare long >> strings of floating point numbers? I, of course, can imagine SQL queries >> plucking single floating point values from rows or indexes, but I can’t >> imagine where the long strings would be. Could you enlighten me? > > Comparing keys in a btree search uses a lot of CPU cycles. If the > comparison can be done using memcmp() rather than some custom > function, the comparison goes much faster, which makes searching > btrees faster. > > -- > D. Richard Hipp > d...@sqlite.org > _______________________________________________ > sqlite-users mailing list > sqlite-users@mailinglists.sqlite.org > http://mailinglists.sqlite.org/cgi-bin/mailman/listinfo/sqlite-users _______________________________________________ sqlite-users mailing list sqlite-users@mailinglists.sqlite.org http://mailinglists.sqlite.org/cgi-bin/mailman/listinfo/sqlite-users
