TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Sorting improvements in PostgreSQL 9.2: the case for micro-optimisation

41 点作者 martinp将近 13 年前

3 条评论

ralph将近 13 年前
Dupe of <a href="http://news.ycombinator.com/item?id=4327654" rel="nofollow">http://news.ycombinator.com/item?id=4327654</a> (thanks to non-canonical URL).
评论 #4328051 未加载
agwa将近 13 年前
Incidentally, this is the same reason why sorting in C++ using std::sort is much faster than qsort[1]. Basically, std::sort, which is templated, lets the compiler do the same specialization and inlining that this article talks about.<p>[1] <a href="http://radiospiel.org/sorting-in-c-3-times-faster-than-c" rel="nofollow">http://radiospiel.org/sorting-in-c-3-times-faster-than-c</a>
saurik将近 13 年前
(Reposting the comment I had left on the other version of this article:)<p>PostgreSQL should really be using a radix sort for these data types, not a quick sort (however "optimized").