#24366: Improve migration dependency graph speed
--------------------------------------+------------------------------------
Reporter: MarkusH | Owner: knbk
Type: Cleanup/optimization | Status: assigned
Component: Migrations | Version: master
Severity: Normal | Resolution:
Keywords: | Triage Stage: Accepted
Has patch: 1 | Needs documentation: 0
Needs tests: 0 | Patch needs improvement: 0
Easy pickings: 0 | UI/UX: 0
--------------------------------------+------------------------------------
Changes (by knbk):
* has_patch: 0 => 1
Comment:
My current results: 991 migrations, 2280 dependencies, and it takes about
15 seconds to generate a full migration plan with python 2.7, about 20
seconds with python 3.4. In both cases, about 75% of that time goes to the
initialization of the internal `OrderedDict` of the `OrderedSet` in
`Node.ancestors` and `Node.descendants`.
Rich ordering based on `node.key` resulted in the exact same ordering as
the previous algorithm.
--
Ticket URL: <https://code.djangoproject.com/ticket/24366#comment:7>
Django <https://code.djangoproject.com/>
The Web framework for perfectionists with deadlines.
--
You received this message because you are subscribed to the Google Groups
"Django updates" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
To view this discussion on the web visit
https://groups.google.com/d/msgid/django-updates/065.e995a885fe0ce19119bae522a327ffeb%40djangoproject.com.
For more options, visit https://groups.google.com/d/optout.
