In this doc it says:
If a query filters on the sort key, the query planner can efficiently skip all the tables that aren't used
I’m curious why skipping an entire table rather than skipping sorted blocks of a single larger table is faster?
I mean it is, I cut single table query time in half by splitting a large wide sorted table in two (2 billion rows instead of 4) and using a union view filtered on sortkey… I’m just wondering why that is under the hood.
