vacuum | firmware builder for roborock

I'm not sure I understood what do you mean by "all affected tables", but to get all hypertables in a single query, you can cast the hypertable name with ::regclass. Example from some playground database with a few random hypertables:

My guess is that url is not in proper form

Try

proxy_pass http://0.0.0.0:5000;

Yes, that is as expected. You need VACUUM to freeze tuples. VACUUM (FULL) doesn't.

Users tend to be confused, because both are triggered by the VACUUM statement, but VACUUM (FULL) is actually something entirely different from VACUUM. It is not just “a more thorough VACUUM”. The only thing they have in common is that they get rid of dead tuples. VACUUM (FULL) does not modify tuples, as freezing has to do, it just copies them around (or doesn't, if they are dead).

I'm not sure about your code example but here it goes:
Fallback function - I think here is a good explanation. So if not marked payable, it will throw exception if contract receives plain ether without data.
External payable - This post explains External well. So it costs less gas to call external than public. Only in your example it would make sense to change buyToken() from "public" to "external". Far as I understand there is no benefit to call public from external...

That first query would benefit from an index on the data and the id in a single index:

Yes, a manual VACUUM of individual tables will do the trick.

Look at the relfrozenxid and relminmxid columns in the pg_class entries for that database. Find the oldest ones. One or more of these should be equal to datfrozenxid and datminmxid in pg_database. If you VACUUM those tables, the values for the database should advance.

Yes, those are the correct settings to make anti-wraparound autovacuum run more often, so that individual runs are smaller.

You can further improve matters for this table if you set vacuum_freeze_min_age to 0, so that all rows are frozen when autovacuum runs.

Note that you can set these parameters on a single table like this:

Every update writes a new row version in Postgres. So (aside from TOASTed columns) updating every row in the table roughly doubles its size. That's what you observe. Dead tuples can later be cleaned up to shrink the physical size of the table - that's what VACUUM FULL does, expensively. See:

• Are TOAST rows written for UPDATEs not changing the TOASTable column?

Alternatively, you might just not run VACUUM FULL and keep the table at ~ twice it's minimal physical size. If you run plain VACUUM (without FULL!) enough - and if you don't have long running transactions blocking that - Postgres will have marked dead tuples in the free-space map by the time the next UPDATE kicks in and can reuse the disk space, thus staying at ~ twice its minimal size. That's probably cheaper than shrinking and re-growing the table all the time, as the most expensive part is typically to physically grow the table. Be sure to have aggressive autovacuum settings for the table. See:

• Aggressive Autovacuum on PostgreSQL
• VACUUM returning disk space to operating system

Probably better yet, break out the ranking into a minimal separate 1:1 table (a.k.a. "vertical partitioning") , so that only minimal rows have to be written "a few times an hour". Probably including elo_rating you mention in the query, which seems to change at least as frequently (?). (LEFT) JOIN to the main table in queries. While that adds considerable overhead, it may still be (substantially) cheaper. Depends on the complete picture, most importantly the average row size in table assets and the typical load apart from your costly updates.

See:

• Many columns vs few tables - performance wise
• UPDATE or INSERT & DELETE? Which is better for storage / performance with large text columns?

Try to avoid the (non-indexed) CTE scan by using a (TEMP) view instead of a CTE [I also replaced the DISTINCT ON(...) BY a NOT EXISTS(...) ]: