Thanks for that Igor - I had RTree in the back of my mine but couldn't remember what or where I had read about it.
before I compile a dll (or someone provides a link to a 32 bit dl with RTree enabled) is RTree likely to be useful in the following scenario? Each look up will usually, but not always, be successful - i.e. about 90% of the time a search will result in about 4 rows being returned the other 10% of the time nothing will be found Just sitting down to look at Simons suggestions. On 5 July 2013 01:47, Igor Tandetnik <i...@tandetnik.org> wrote: > On 7/4/2013 5:29 PM, Paul Sanderson wrote: > >> select * from master as m, lookup as l where x >= start and and x < end >> and >> m.index = l.index >> > > You might want to look at the RTree module: > > http://www.sqlite.org/rtree.**html <http://www.sqlite.org/rtree.html> > > It's specifically designed to implement such range queries efficiently. > -- > Igor Tandetnik > > > ______________________________**_________________ > sqlite-users mailing list > sqlite-users@sqlite.org > http://sqlite.org:8080/cgi-**bin/mailman/listinfo/sqlite-**users<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
