I am wondering in particular about PostgreSQL. Given the following contrived example:
SELECT name FROM
(SELECT name FROM people WHERE age >= 18 ORDER BY age DESC) p
LIMIT 10
Are the names returned from the outer query guaranteed to be be in the order they were for the inner query?
No, put the order by in the outer query:
The inner (sub) query returns a result-set. If you put the order by there, then the intermediate result-set passed from the inner (sub) query, to the outer query, is guaranteed to be ordered the way you designate, but without an order by in the outer query, the result-set generated by processing that inner query result-set, is not guaranteed to be sorted in any way.
For simple cases, @Charles query is most efficient.
More generally, you can use the window function
row_number()
to carry any order you like to the main query, including:SELECT
list of the subquery and thus not reproducibleORDER BY
criteria. Postgres will reuse the same arbitrary order in the window function within the subquery. (But not truly random order fromrandom()
for instance!)If you don't want to preserve arbitrary sort order of peers from the subquery, use
rank()
instead.This may also be generally superior with complex queries or multiple query layers:
The are not guaranteed to be in the same order, though when you run it you might see that it is generally follows the order.
You should place the order by on the main query