From: auxsvr@gmail.com
To: pgsql-general@lists.postgresql.org
Subject: Re: Design of a reliable task processing queue
Date: Sun, 19 Jan 2025 18:06:12 +0200
Message-ID: <2686461.fDdHjke4Dd@linux>
In-Reply-To:
 <CA+vxVFNLn7TOOmE+DRfOJ2z-fpaHYveRg9mq+tYZYG_pckBMfA@mail.gmail.com>
References:
 <CA+vxVFNLn7TOOmE+DRfOJ2z-fpaHYveRg9mq+tYZYG_pckBMfA@mail.gmail.com>
MIME-Version: 1.0
Content-Transfer-Encoding: 7Bit
Content-Type: text/plain; charset="utf-8"
Archived-At: <https://www.postgresql.org/message-id/2686461.fDdHjke4Dd%40linux>
Precedence: bulk

On Saturday, 18 January 2025 12:44:07 EET Alex Burkhart wrote:
> Hey team,
> 
> I'm looking for help to organize locks and transaction for a reliable task
> queue.
> 
> REQUIREMENTS
> 
> 1. Pending actions are persisted to a database. There's a trace once they
> are done.
> 2. Application workers pick actions one by one. At any given time, each
> action can be assigned to at most one worker (transaction).
> 3. If multiple actions have same "lock_id", only one of them is processed
> at the time. That has to be action with smallest id.

Why reinvent the wheel and not use production-ready code from projects such as que (Ruby), pgqueuer (Python)?
-- 
Regards,
Peter