-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
Михајло Анђелковић:
> WHERE rev_id > 0 AND rev_id < [...] AND rev_deleted = 0;
Please check that MySQL plans this correctly (using the rev_id index).
> If this is generally allowed to do, my question is how large chunks of
> data can I take at once, and how long should be waited between two
> takes?
A simple fetch like this doesn't usually take many resources. You can probably
pick any random number for chunking. If you run each chunk under SGE[0] as a
separate job, and request an sqlprocs resource, SGE will handle scheduling for
you so there's no need to worry about how long to wait between runs.
- river.
[0] https://wiki.toolserver.org/view/Job_scheduling
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.11 (FreeBSD)
iEYEARECAAYFAkzzsQgACgkQIXd7fCuc5vI7ZACbBkmQAFXTSBEDYm+I8xf+Ci4X
LFQAnjOPp1zFUQ/Njs90nQ4us4IZswZE
=mPqu
-----END PGP SIGNATURE-----
_______________________________________________
Toolserver-l mailing list (Toolserver-l@lists.wikimedia.org)
https://lists.wikimedia.org/mailman/listinfo/toolserver-l
Posting guidelines for this list:
https://wiki.toolserver.org/view/Mailing_list_etiquette
