mirror of
https://github.com/google/nomulus.git
synced 2025-05-12 22:38:16 +02:00
Improve efficiency of async contact and host deletion with batching
This allows handling of N asynchronous deletion requests simultaneously instead of just 1. An accumulation pull queue is used for deletion requests, and the async deletion [] is now fired off whenever that pull queue isn't empty, and processes many tasks at once. This doesn't particularly take more time, because the bulk of the cost of the async delete operation is simply iterating over all DomainBases (which has to happen regardless of how many contacts and hosts are being deleted). ------------- Created by MOE: https://github.com/google/moe MOE_MIGRATED_REVID=133169336
This commit is contained in:
parent
75d9268ecd
commit
00ea99960a
22 changed files with 1186 additions and 16 deletions
|
@ -42,6 +42,7 @@ import google.registry.export.sheet.SheetModule;
|
|||
import google.registry.export.sheet.SyncRegistrarsSheetAction;
|
||||
import google.registry.flows.async.AsyncFlowsModule;
|
||||
import google.registry.flows.async.DeleteContactResourceAction;
|
||||
import google.registry.flows.async.DeleteContactsAndHostsAction;
|
||||
import google.registry.flows.async.DeleteHostResourceAction;
|
||||
import google.registry.flows.async.DnsRefreshForHostRenameAction;
|
||||
import google.registry.mapreduce.MapreduceModule;
|
||||
|
@ -88,7 +89,9 @@ interface BackendRequestComponent {
|
|||
BrdaCopyAction brdaCopyAction();
|
||||
CommitLogCheckpointAction commitLogCheckpointAction();
|
||||
CommitLogFanoutAction commitLogFanoutAction();
|
||||
// TODO(b/26140521): Remove separate contact/host actions here.
|
||||
DeleteContactResourceAction deleteContactResourceAction();
|
||||
DeleteContactsAndHostsAction deleteContactsAndHostsAction();
|
||||
DeleteHostResourceAction deleteHostResourceAction();
|
||||
DeleteOldCommitLogsAction deleteOldCommitLogsAction();
|
||||
DnsRefreshForHostRenameAction dnsRefreshForHostRenameAction();
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue