Skip to content

Instantly share code, notes, and snippets.

What would you like to do?
Django efficient queryset iterator (by dividing in chunks). Taked from
import gc
def queryset_iterator(queryset, chunksize=1000):
Iterate over a Django Queryset ordered by the primary key
This method loads a maximum of chunksize (default: 1000) rows in it's
memory at the same time while django normally would load all rows in it's
memory. Using the iterator() method only causes it to not preload all the
Note that the implementation of the iterator does not support ordered query sets.
pk = 0
last_pk = queryset.order_by('-pk')[0].pk
queryset = queryset.order_by('pk')
while pk < last_pk:
for row in queryset.filter(pk__gt=pk)[:chunksize]:
pk =
yield row
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment