James,
Indeed, that's the case.
However, I can't imagine this to be efficient. It's just a pure sql
workaround to a counter.
The only advantage is, it is standard sql and should work with any engine.
I wonder if sqlite would make some optimizations out of it, otherwise
it's O(n^2) WHEN having an index for the sort field.
Update: with no index, sqlite uses only one temp b-tree which would be
needed anyway for sorting.
Gabriel
_______________________________________________
sqlite-users mailing list
sqlite-users@sqlite.org
http://sqlite.org:8080/cgi-bin/mailman/listinfo/sqlite-users
