On Fri, Oct 19, 2012 at 10:57 PM, Keith Medcalf <[email protected]> wrote:
> > As far as I can tell, the SQLite engine does an inorder traversal of the > tree when doing a table scan (ie, from lowest to highest) returning rows in > rowid order. > While this is presently how SQLite works, it may not always be so. > Indeed, this will change in version 3.7.15 with the addition of a new optimization that will scan covering indices instead of the original table, when a covering index is available. You can try it out by downloading and compiling the tip of trunk, if you like. -- D. Richard Hipp [email protected] _______________________________________________ sqlite-users mailing list [email protected] http://sqlite.org:8080/cgi-bin/mailman/listinfo/sqlite-users
