if we initially have $1\mathrm{.}2$ septillion objects $($that will increase logarithmically over time$)$ to be stored, retrieved, accessed, deleted, and processed on a computer, then the best data structure to use will depend on: $1.$ the size of the objects and speed of the computer $2.$ how the problem and solution are modeled $3.$ the data structure that can store the most dynamic data and takes the least amount of time to access $4.$ Algorithms that are designed to process large static amounts of data in log$($N$)$ or less than log$($N$)$ time.