From: | Matthew Phillips <mphillips34(at)gmail(dot)com> |
---|---|
To: | pgsql-general(at)postgresql(dot)org |
Subject: | READ UNCOMMITTED in postgres |
Date: | 2019-12-18 23:12:55 |
Message-ID: | CAFWy7AZpq1y8scTo6KeO+OLwwWt+OnC1=5iHCDSQJ_5iZd4EFw@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-general |
Hi,
With the current READ UNCOMMITTED discussion happening on pgsql-hackers
[1], It did raise a question/use-case I recently encountered and could not
find a satisfactory solution for. If someone is attempting to poll for new
records on a high insert volume table that has a monotonically increasing
id, what is the best way to do it? As is, with a nave implementation, rows
are not guaranteed to appear in monotonic order; so if you were to keep a
$MAX_ID, and SELECT WHERE p_id > $MAX_ID, you would hit gaps. Is there a
clean way to do this? I've seen READ UNCOMMITTED used for this with DB2.
Thanks
Matt
From | Date | Subject | |
---|---|---|---|
Next Message | Stephen Frost | 2019-12-18 23:20:03 | Re: READ UNCOMMITTED in postgres |
Previous Message | Erik Jones | 2019-12-18 23:01:30 | AccessExclusiveLock with pg_locks.locktype of tuple |