It seems trivial to accelerate a MAX or MIN query with a BRIN index. You just find the page range with the largest/smallest value, and then only scan that one. Would that be hard to implement? I'm interested in working on it if someone can give me some pointers.
Somewhat harder but still possible would be using BRIN indexes to accelerate ORDER BY. This would require a sorting algorithm that can take advantage of mostly-sorted inputs. You would sort the page ranges by their minimum or maximum value, then feed the sorting algorithm in that order.
