Timeline for Efficient methods for storing tens of millions of objects for querying, with a high number of inserts per second?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 16, 2012 at 7:15 | comment | added | Josh | The five minute thing is due to the fact that these 300 connections may receive the same packet. So I have to keep track of what I have already handled, and 5 minutes is the amount of time it takes for packets to fully propagate to all nodes on this particular network. | |
| Mar 15, 2012 at 14:16 | comment | added | Ed James | Don't use a string/byte array, use something like a BitArray: msdn.microsoft.com/en-us/library/… to avoid having to manually bit-twiddle. Otherwise, this is a good answer, there's not really an easy option other than better algorithms, more hardware or better hardware. | |
| Mar 15, 2012 at 14:04 | history | answered | Steve | CC BY-SA 3.0 |