Re:Kth: High-Performance Selection Algorithms for Go
by tsenart on Wednesday December 04, 2024 @08:36PM
(#42323933)
Yes! A typical use case is to efficiently implement ORDER BY LIMIT N in SQL databases in a way that doesn’t require sorting the entire column just to get those first N items.
[ Parent
| on HN ]
Re:Kth: High-Performance Selection Algorithms for Go
by johnthescott on Sunday December 08, 2024 @02:26AM
(#42355574)
i assume this go code runs in the client since pg does not support golang server side. why would a client side ordering be faster than doing in the database?