3 ms·
Probably order of magnitude more or perhaps a multiple of that depending on the hardware and design. In theory an append-only and/or HOT strategy leaning on Po
by Rapzid 3y ago
Probably order of magnitude more or perhaps a multiple of that depending on the hardware and design.
In theory an append-only and/or HOT strategy leaning on Postgres just ripping through moderate sized in-mem lists could be incredibly fast. Design would be more complicated and perhaps use case dependent but I bet could be done.
- qaq 3y agoYep that's why I specifically mentioned "fairly modest instance" on reasonably fast box you can get magnitude more. You can partition the tasks table to reduce the number of rows skip locked has to run through to grab next task.