>> Maybe I'll try a binary search, or something else along those lines. >> > > You can mix binary search with sqlite as a storar. The idea is to place your > words ordered by text and use rowid as indexes. >
I tried this, and it works surprisingly well. I'm also going to try a straight binary search form an array, just to see how much memory my app then consumes. Anyway, thanks for all the advice. > So after creating a new table > > CREATE TABLE Table2 AS SELECT * FROM Table ORDER BY Text > > you now can access each row by "index" since rowids is guaranteed to be > consequential numbers. So accessing in your binary search is > > SELECT Text FROM Table2 WHERE rowid=? > > Max > _______________________________________________ > sqlite-users mailing list > sqlite-users@sqlite.org > http://sqlite.org:8080/cgi-bin/mailman/listinfo/sqlite-users > _______________________________________________ sqlite-users mailing list sqlite-users@sqlite.org http://sqlite.org:8080/cgi-bin/mailman/listinfo/sqlite-users
