It shouldn't matter, the rowid is guaranteed to but unique since it's the row's key into the table data b-tree. The ORDER BY in my example adds sorting based on that value when the titles are the same so you in effect have a unique sort key that is ordered.
-Jeff On 3/15/08, dcharno <[EMAIL PROTECTED]> wrote: > Jeff Hamilton wrote: > > What about something like this: > > > > SELECT title FROM tracks > > WHERE singer='Madonna' > > AND (title<:firsttitle OR (title=:firsttitle AND rowid<:firstrowid)) > > ORDER BY title DESC, rowid ASC > > LIMIT 5; > > > > Then you only have to remember the single title and rowid of the first > > item in the list. You'd have to add the rowid ASC to your index as > > well, but the index already needs to store the rowid so I don't think > > it would take more space. > > > But, I think the rowid has no specific ordering to it. > > _______________________________________________ > 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
