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

科技回声

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

GitHubTwitter

首页

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

资源链接

HackerNews API原版 HackerNewsNext.js

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

How Long Does a YC Hiring Link Stay On the Front Page?

45 点作者 kiyoto将近 11 年前

4 条评论

gojomo将近 11 年前
Looks like the original ranking formula as announced at...<p><a href="http://ycombinator.com/newsnews.html#12may11" rel="nofollow">http:&#x2F;&#x2F;ycombinator.com&#x2F;newsnews.html#12may11</a><p>...was tweaked a bit: now starting at #6 rather than #4; now descending one position every 8 minutes rather than every 15 minutes.<p>(I&#x27;m surprised they don&#x27;t stay for a full day; that would seem a reasonable way to reach anyone who visits at least once daily.)
评论 #7804905 未加载
zopf将近 11 年前
Cool analysis. I wonder if you could show something like a LOESS curve fitted across all the articles&#x27; timeseries? Or if they&#x27;re all roughly linear descents, I wonder if you could show the distribution of slopes - do some descend faster than others? Why?<p>And then, a bone to pick:<p>Need a beefy RDBMS for 15mm rows? Maybe if you want to store the whole denormalized table in memory, but if you&#x27;re just indexing a small field (or even partial-indexing a larger field) you should have no problem. The table will just spill to disk and page in as necessary, and you&#x27;re mostly appending anyway so you shouldn&#x27;t have much trouble. Plus, you could normalize the data: store the (large) article title in an Articles table with an id (hash of title?) and then just store the ranks in a Ranks table for <i>less</i> overall storage than the NoSQL database (thus needing a less-beefy machine).<p>Nothing against modern Not-only-SQL solutions or document stores, but don&#x27;t discount RDBMS. Schemas aren&#x27;t so scary or unwieldy that you should never use them.<p>Anyway, thanks for an informative post!
评论 #7805598 未加载
评论 #7804703 未加载
jacquesm将近 11 年前
This reads like an extremely well disguised ad.
评论 #7805463 未加载
brickmort将近 11 年前
This was a very cool read. nice job!