[libvirt] [PATCH 0/4] snapshot: optimize qemu relationship traversal
Daniel Veillard
veillard at redhat.com
Mon Oct 10 02:26:30 UTC 2011
On Fri, Oct 07, 2011 at 06:05:53PM -0600, Eric Blake wrote:
> After working with ESX and VBox, I realized that a tweak to how
> snapshot relationships are stored would speed things up from O(n^2)
> to O(n). The hash table must be kept for name lookup, but the
So we went from 0(n^3) to O(n), sounds good :-)
> speedup comes by tracking relationships with each snapshot rather
> than crawling the entire hash table rebuilding those relations
> for every operation that needs particular relations.
As long as we are sure there is no risk of stale relationship
metadata, this sounds proper ...
Daniel
--
Daniel Veillard | libxml Gnome XML XSLT toolkit http://xmlsoft.org/
daniel at veillard.com | Rpmfind RPM search engine http://rpmfind.net/
http://veillard.com/ | virtualization library http://libvirt.org/
More information about the libvir-list
mailing list