> I would be interested to know the results for very large data sets. > Indications on the list have been that performance suffers when the number > of records gets very big (> 1 million), possibly due to using an internal > sort.
I must say, with a 2+ million row data set, we aren't getting anywhere near these sort of speed results. Probably in the order of 10 times slower if not much, much more. However, I havn't written any generic tools to reconfirm this, rather this is based on the results our current SQLite3 project is spitting back