Cesar David Rodas Maldonado said: > 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?
If you're going to the trouble of building your own hash table, why bother with SQLite? The Hash table will provide faster access to the data, assuming that you load the entire list of words into RAM, but will be more memory intensive than using SQLite. This is assuming that the SQLite database lives on disk. If the SQLite database lives in memory, it's still going to take less RAM (btrees are almost always more compact than hash tables), but the speed will depend on the efficiency of your hash implementation. Clay -- Simple Content Management http://www.ceamus.com
