Hacker Newsnew | past | comments | ask | show | jobs | submit | fuy's commentslogin

CLUSTER command is not the same as index organized tables, it's a one-time "physical sort" operation. New data is not organized until you run CLUSTER again. Index organized tables are maintained automatically by Oracle/SQL Server.

Not just maintained automatically, clustered indexes have no heap at all, the table is an index.

The CLUSTER command in PG just moves rows around in the heap so they match the still separate index order which can help a little bit with range operations because rows are close on disk, but otherwise doesn't do much.

So they are completely separate things that just happen to use the same term.


Interesting, i didnt know that. Thanks!

Not saying you're wrong, but solo developers building (relatively) greenfield projects are the best bet for increased AI productivity.

Solo dev projects are usually reasonably sized (< million LOC), style is more uniform, there's fewer silos etc. etc.

Good studies look at a broader picture.


It’s a very good point. I have full control and everything is incredibly uniform, and more recently designed with agents in mind. This must make things significantly easier for the LLM.


isn't this template supposed to mean that all the previous considerations are now obsolete?


I guess you could argue that the standard LLM sentence structure is too robotic but prompting mostly fixes that.

The rest is no longer true, indeed


It's web in a (limited) sense that there's probably a web frontend somewhere, but this "somewhere" is usually pretty far away from where most of the code is developed.

Most of the backend logic is not related to serving data for the browsers, it's doing actual backend stuff - communicating to databases, APIs, etc.

Is Google search backend a web app? I think it's really stretching the term.


Looking at first optimization, I wonder if double-checking after acquiring exclusive lock brings any performance benefits. The whole premise is that cache access is read-heavy, so not acquiring exclusive locks for reads eliminates by far the biggest problem.

Rare (I presume) cases of overlapping updates from different threads (considering updates themselves are also infrequent) don't seem like a big deal compared to lock elimination. Would be interesting to see benchmark numbers for those optimizations separately.


perf and look at stack traces (or off-cpu events for waits/locks). also, ebpf


Hey Tanel - I wanted to thank you for that blog post and psn tool - it recently helped me in a tricky performance investigation.


Glad to be helpful! :-)


Had similar situation a few years before - switched a (now) billion revenue product from Read Committed to Read Committed Snapshot with huge improvements in performance. One thing to be aware when doing this - it will break all code that rely on blocking reads (e.g. select with exists). These need to be rewritten using explicit locks or some other methods.


isolation levels, that is!


Top 5% overall or top 5% of dev jobs? Former sure, latter might be not? I live in Prague, and there are definitely multiple companies that pay more than 90k to middle positions. especially if it's before taxes.


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: