On 6/4/08, D. Richard Hipp <[EMAIL PROTECTED]> wrote: > > On Jun 4, 2008, at 6:53 AM, Christophe Leske wrote: > > > Hi, > > > > i am still fiddling around with my database and was wondering which > > kind > > of query would be quicker? > > > > > Let me strongly reiterate that you look into using the new R-Tree > virtual table available for SQLite. R-Trees are specifically designed > to do exactly the kind of query you are asking to do. See > > http://www.sqlite.org/cvstrac/fileview?f=sqlite/ext/rtree/README&v=1.2 > > R-Trees will be way faster than anything you will do using B-Tree > indices. >
So, I downloaded and built SQLite from CVS. I see R*Tree being configured and built. Is there are README (other than the one in ext/rtree) that tells how to create and rtree index? Puneet. _______________________________________________ sqlite-users mailing list sqlite-users@sqlite.org http://sqlite.org:8080/cgi-bin/mailman/listinfo/sqlite-users
