Nope, there is no difference in DB traffic. The difference is just that the former does the ORM work on each row when it is about to give it to you, while the second does the ORM work on all rows, before starting to give them to you.
Note that q.all()
is just sugar for list(q)
, i.e. collecting everything yielded by the generator into a list. Here is the source code for it, in the Query
class:
def all(self):
"""Return the results represented by this ``Query`` as a list.
This results in an execution of the underlying query.
"""
return list(self)
... where self
, the query object, is an iterable, i.e. has an __iter__
method.
So logically the two ways are exactly the same in terms of DB traffic; both end up calling query.__iter__()
to get a row iterator, and next()
ing their way through it.
The practical difference is that the former can start giving you rows as soon as their data has arrived, “streaming” the DB result set to you, with less memory use and latency. I can't state for sure that all the current engine implementations do that (I hope they do!). In any case the latter version prevents that efficiency, for no good reason.