C # Should hashtable or datatable be used when processing a large amount of data ?,

C # Should hashtable or datatable be used when processing a large amount of data ?,

If you search by priority, it is best to use Hashtable. Hashtable provides a fast search mechanism when searching by "KEY" VALUE, and it is also very fast when searching by "VALUE" VALUE.

If you want to delete a specific element, use Hashtable (UseRemoveMethod)

Hashtable is not required for element storage sequence. If you need some elements in a specific sequence, do not use Hashtable. Hashtable cannot sort the content.

Do not use Hashtable if you want to insert elements at a specific position.

If the data contains multiple KEY-value pairs with the same "KEY" value, do not use Hashtable. Because all "KEY" values in Hashtable must be unique