To give you a better idea, let's consider a rough estimate of the growth rate of vector databases. Assuming a moderate growth rate, the number of possible unique vectors in a vector database might grow at a rate similar to:
d^(log(d))
This growth rate is slower than the exponential growth rate, but still significant.
Keep in mind that these are rough estimates and the actual growth rate of vector databases can vary widely depending on the specific implementation and use case.