4 ms·
Kth: High-Performance Selection Algorithms for Go
- brodouevencode 2y agoRequest: version the library so it's a little easier to manage.
- tsenart 2y agoAuthor here! Will do eventually.
- nnx 2y agoThis looks interesting but I can't think of an use case. Can you share some examples where it could be useful?
- tsenart 2y agoYes! 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.
- johnthescott 2y agoi 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?
- tsenart 2y agoThis is to implement a database, not use one.