2 ms·
When building a search engine the biggest problem isn't QPS but the size of the data set you are indexing. If your search structures can fit in memory of a sing
by paxys 3y ago
When building a search engine the biggest problem isn't QPS but the size of the data set you are indexing. If your search structures can fit in memory of a single machine then you can serve effective infinite QPS with ~zero latency. When it grows beyond that you have to get creative, and that's when all the different tradeoffs come into the picture.