Data structures for efficient insertions and deletions to large arrays -

What is the data structure suitable for efficiently inserting and deleting large amounts?

Recovery should still be fast!

Example Use Case: With a very large spreadsheet, 100,000 rows and 1000 columns, and we want to insert 200 columns in between. We have to do a 100,000 insertion in the 1000 element array.

It looks like something I see, but it is designed for string; I'm not sure that this is generalized for the list of arbitrary items.

B-trees are also interesting, but I do not want the element in the array to sort according to some parameters .. I am putting them in order to sort them only!

You can use the rope for arbitrary objects. Instead of storing substrings in the leaves, you can store the requirements you can keep.