Kth: High-Performance Selection Algorithms for Go
1–7 of 7 posts
Re: Kth: High-Performance Selection Algorithms for Go
#2Request: version the library so it's a little easier to manage.
Re: Kth: High-Performance Selection Algorithms for Go
#3Request: version the library so it's a little easier to manage.
Author here! Will do eventually.
Re: Kth: High-Performance Selection Algorithms for Go
#4This looks interesting but I can't think of an use case. Can you share some examples where it could be useful?
Re: Kth: High-Performance Selection Algorithms for Go
#5This looks interesting but I can't think of an use case. Can you share some examples where it could be useful?
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.
Re: Kth: High-Performance Selection Algorithms for Go
#6This looks interesting but I can't think of an use case. Can you share some examples where it could be useful?
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.
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?
Re: Kth: High-Performance Selection Algorithms for Go
#7Earlier quoted context omitted.
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.
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?
This is to implement a database, not use one.