nuttingd

6 ms·

1.
by nuttingd 2y ago
You would need to use serializable isolation for this to hold true. Any isolation level less than serializable will use the snapshot that was active at the time of the select. In Postgres, even with the serializable isolation level, all tra
2.
by nuttingd 2y ago
import my_module This is compatible with `__all__` if you have your code broken down into smaller sub-modules and collect them in the main module as follows: # my_module/__init__.py from .submodule import * from .anothe
3.
by nuttingd 2y ago
> which makes a very simple concept vastly more confusing than it needs to be. Agreed. The concepts are all very simple. You can throw away all of the domain-specific terminology and reason about accounting theory with nothing but positi
4.
by nuttingd 2y ago
It's the accounting equation being represented in canonical form. A chart of accounts is visualized in the minds of an accountant as: Assets | Liabilities + Equity Accounts classified as assets are debit accounts (left side), and accou
5.
by nuttingd 3y ago
I have read the docs plenty of times, but it never stuck for me until I read the (free!) PostgreSQL 14 Internals ebook: https://postgrespro.com/community/books/internals Quoted from Page 70: If you use the Serial
6.
by nuttingd 3y ago
One caveat to serializable transactions in Postgres is that ALL concurrent transactions must be running with the SERIALIZABLE isolation level to protect against serialization anomalies. This is a bit jarring if you come from MSSQL, which im
7.
by nuttingd 3y ago
> (Newspeak “Sprint and Goals”) Sprint "commitments" in my world. A single word with major psychological impacts.
8.
by nuttingd 3y ago
The check constraint solution isn't a solution to the concurrency issue: it only prevents a negative balance. The balance would still be wrong for the whole range where balance > 0. Two (positive) deposits would not store the correc
9.
by nuttingd 5y ago
Pagination is harder than it seems to get right. I think pagination is only predictable under these conditions: 1) The offset used for the next fetch must be based on a pointer to a unique key. We can't rely on the number of rows previ