{"id":796,"date":"2020-04-14T09:00:18","date_gmt":"2020-04-14T16:00:18","guid":{"rendered":"https:\/\/devblogs.microsoft.com\/cosmosdb\/?p=796"},"modified":"2020-04-13T14:14:37","modified_gmt":"2020-04-13T21:14:37","slug":"bulk-improvements-net-sdk","status":"publish","type":"post","link":"https:\/\/devblogs.microsoft.com\/cosmosdb\/bulk-improvements-net-sdk\/","title":{"rendered":"Bulk support improvements for Azure Cosmos DB .NET SDK"},"content":{"rendered":"

Bulk support<\/a> has been available since version 3.4.0 of the Azure Cosmos DB .NET SDK<\/a>. In this post we’ll go over the improvements released in the recent 3.8.0 SDK and how they affect your bulk operations.<\/p>\n

All aboard<\/h3>\n

As we described in our previous post<\/a>, the SDK groups concurrent operations based on partition affinity and dispatches them as a single request. This means that if the data is distributed evenly across a wide range of partition key values (with different partition affinity), the SDK can create multiple independent groups of operations and dispatch them in parallel.<\/p>\n

\"Bulk<\/p>\n

In our initial Bulk implementation, we allowed multiple parallel requests as long as they had a different partition affinity, but only a single in-flight request for each partition.<\/p>\n

Think of it as a train station<\/strong>. There will be one train track<\/strong> per partition, and each operation is a passenger<\/strong> inside a train. Multiple trains can depart at the same time as long as they are on different tracks<\/strong>, but on the same track only one train can be moving, the next one will depart when the previous one comes back<\/strong>.<\/p>\n

What’s changed?<\/h3>\n

In 3.8.0, we added a congestion control component<\/a> to bulk. Now, the SDK will send multiple requests in parallel for the same partition. If it detects throttling, it will start to limit the degree of parallelism on that partition. As long as throttling continues it will keep decreasing it until it achieves a balance between available throughput and volume of requests (or the minimum of 1).<\/p>\n

Following the train example, trains heading to the same destination (partition) can now depart as soon as their are full<\/strong>, regardless of whether the previous train came back or not. If a congestion happens on the destination, the manager will reduce the amount of trains that can be on course on the same track at any given point in time until it reaches a balance.<\/p>\n

What are the expected improvements?<\/h3>\n

This change means that we are increasing the data flow<\/strong> from the client and reactively decreasing it if the provisioned throughput<\/a> is not enough. Early performance numbers show an increase in throughput after this change. For example, in a container provisioned with 300,000 RU\/s, we are now able to insert 4.8 million documents in 2 minutes versus 4.3 million before (almost 20% more<\/strong> on the same time).<\/p>\n

When measuring time taken, in a container provisioned with 1 million RU\/s, inserting 5 million documents now takes 77 seconds versus 350 seconds before (almost 80% faster<\/strong>).<\/p>\n

In scenarios where the provisioned throughput is much lower compared with the data volume (for example, inserting 10,000 documents in a container provisioned with 3,000 RU\/s), we see an increase in throttling but the overall elapsed time remains in the same line as before.<\/p>\n

Next steps<\/h3>\n