3 ms·
Wait a second, the whole thing is you don't mind O(N) overhead in searching on every request, but you mind O(log N) overhead for updates and inserts?
by EGreg 3y ago
Wait a second, the whole thing is you don't mind O(N) overhead in searching on every request, but you mind O(log N) overhead for updates and inserts?
- titaniczero 3y agoWell, my guess is that updates and inserts are much more frequent than searches in their use case. You're assuming a balanced frequency for these operations and it hardly ever happens.
- wswope 3y agoThis is a read-heavy workload per the OP: https://news.ycombinator.com/item?id=36071799 https://news.ycombinator.com/item?id=36071799