"Design a data structure that can support the following three operations with O(1) time complexity:

Insert a new element into the data structure.

Remove an element from the data structure.

Find the kth smallest element in the data structure.

The data structure should also support efficient search and retrieval of elements. Additionally, the data structure should be able to handle large volumes of data and be able to scale well as the size of the data increases."