uniform distribution isn't always the worst case. just for an example, if you stuff a btree with pages and pages of the same key it starts to get funny. it also

uniform distribution isn't always the worst case. just for an example, if you stuff a btree with pages and pages of the same key it starts to get funny. it also doesn't really exercise the join ordering machine correctly if every key has at most one correlate.