Median aggregate function is slow
The Median aggregate function is slow. The b-tree version needs O(n log n) and is not very efficiently implemented. There are algorithm out there with Average performance of O(n) like Quickselect.
The Median aggregate function is slow. The b-tree version needs O(n log n) and is not very efficiently implemented. There are algorithm out there with Average performance of O(n) like Quickselect.