Cesar, in that case Clay Dowling's answer says it all: it's faster to use an hash as an index preloading all your data into your RAM memory (without SQLite), but if you don't want to use that amount of memory then you could use an INDEX that will create a Binary Tree (=btree) that will make your search faster.
Best regards, Daniel Colchete Cesar David Rodas Maldonado wrote: > I know that, but I would like to know if will be better first > transform the > word into a number (a hash function), after that select the number and > after > search with the index of the word... > understand?. I am sorry for my english... > > On 7/21/06, Daniel van Ham Colchete <[EMAIL PROTECTED]> wrote: >> >> Cesar David Rodas Maldonado wrote: >> > Hello to everybody >> > >> > If I have a table with 100.000 unique words I am wondering if SQLite >> > select >> > if faster an cheaper (RAM, Processor, etc), or If i have to help >> SQLite >> > using a Hash function, and what could be that Hash function? >> > >> > Thanks. >> > >> Cesar, >> >> you should consider using an index: >> http://www.sqlite.org/lang_createindex.html >> >> Best regards, >> Daniel Colchete >> >> >
