summaryrefslogtreecommitdiff
path: root/docs/ref
diff options
context:
space:
mode:
authorNatalia <124304+nessita@users.noreply.github.com>2025-08-28 17:19:20 -0300
committerNatalia <124304+nessita@users.noreply.github.com>2025-10-08 18:27:56 -0300
commit953163e6106d6e0135214589d33503613ea35b4d (patch)
tree9a6f3242169843bbd5834e2d689475655a29a39a /docs/ref
parentd0d2dd7706ab8c852a113547c6b9973baf3c7e16 (diff)
[6.0.x] Fixed #36526 -- Doc'd QuerySet.bulk_update() memory usage when batching.
Thanks Simon Charette for the review. Backport of 608d3ebc8889863d43be1090d634b9507fe4a85e from main.
Diffstat (limited to 'docs/ref')
-rw-r--r--docs/ref/models/querysets.txt15
1 files changed, 15 insertions, 0 deletions
diff --git a/docs/ref/models/querysets.txt b/docs/ref/models/querysets.txt
index 99bbbb54a4..ddeb9ab45b 100644
--- a/docs/ref/models/querysets.txt
+++ b/docs/ref/models/querysets.txt
@@ -2516,6 +2516,21 @@ them, but it has a few caveats:
* If updating a large number of columns in a large number of rows, the SQL
generated can be very large. Avoid this by specifying a suitable
``batch_size``.
+* When updating a large number of objects, be aware that ``bulk_update()``
+ prepares all of the ``WHEN`` clauses for every object across all batches
+ before executing any queries. This can require more memory than expected. To
+ reduce memory usage, you can use an approach like this::
+
+ from itertools import islice
+
+ batch_size = 100
+ ids_iter = range(1000)
+ while ids := list(islice(ids_iter, batch_size)):
+ batch = Entry.objects.filter(ids__in=ids)
+ for entry in batch:
+ entry.headline = f"Updated headline {entry.pk}"
+ Entry.objects.bulk_update(batch, ["headline"], batch_size=batch_size)
+
* Updating fields defined on multi-table inheritance ancestors will incur an
extra query per ancestor.
* When an individual batch contains duplicates, only the first instance in that