3 ms·
Large objects are _mostly_ an access method, the underlying implementation is staggeringly similar to TOAST. > The large object implementation breaks large obj
by dijit 5y ago
Large objects are _mostly_ an access method, the underlying implementation is staggeringly similar to TOAST.
> The large object implementation breaks large objects up into “chunks” and stores the chunks in rows in the database. A B-tree index guarantees fast searches for the correct chunk number when doing random access reads and writes.
You might try Foreign Data Wrapping.
In which case I still wouldn't because the database is going to be spending more time in doing round trips, better my application server does that, there's usually more of them.