A jobs queue: workers pick up new tasks. Another worker already took one — its row is locked. Write a statement that claims the next FREE new task (without waiting for the locked one), marks it done and returns its id. A worker must not stall on an already-taken task.