> So on specific data, the heap may be better than the loser tree. But I think the possibility > is very small. For example, a column contains all the same values, so the heap can always early return when replacing top. -- Regards, ChangAo Chen
pgsql-hackers by date:
Соглашаюсь с условиями обработки персональных данных