This still appears to be the case.
I created two identical files with 50 TO groups (TOGs), each group with 6 TOs (one parent TO and 5 child TOs). In one of the files, I connected all the parent TOs to a single CONNECTOR TO. So we have one graph with discrete TOGs (Anchor Buoy) and one where everything is linked (Spider/SelectorConnector). The two graphs look like this:
I hosted both files on an AWS t2.small EC2 running FileMaker Server 19.2.1. I accessed files using client Pro 19.2.2.
I ran a script in both files Time PSOS, which just calls an empty script (PSOS) via PSOS and measures how long it takes to complete that step:
The results:
| Graph | Time |
|---|---|
| Spider | 500-700 ms |
| Anchor Buoy | 100-120 ms |
So discrete TOs seem to still outperform spiders/connectors, and the performance benefit manifests even in graphs a fraction of the size the one Honza tested with.