CS> What are you actually trying to do? And can you quantify "very slow" and
CS> tell us what you actually expect or what would be acceptable?
100,000 oll ok 7 seconds
1,000,000 software halt :(

CS> Is this representitive of what you are trying to do? Are you storing IP
CS> addresses, and you want to discard duplicates? Using the "on conflict"
CS> resolution is probably your fastest course of action.
I write log analyzer and want to use sqlite as database.

All Operations in my software grouping big list strings.
and need the fastest speed.
if use "group by" it is slow :(

>if all he's doing is discarding duplicate strings, with no requirement for
>persistent storage, it is easily done with a primitive hash table
>implementation. could probably be done efficiently in less than a hundred
>lines of c, most of which could be adapted from some example code.
Yes need disk-based hash or btree. But SQLite in the low level it
Disk-Based Btree.


-- 
Best regards,
 Yuriy                            mailto:[EMAIL PROTECTED]

Reply via email to