TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Evolution of tree data structures for indexing

101 pointsby baotiaoalmost 4 years ago

3 comments

renewiltordalmost 4 years ago
Something I've always wondered is if there is any benefit in tuning these tree-based indices for SSDs. Would you make them deeper and narrower? Or do you usually just aim to load your indices in main mem anyway?
评论 #27969530 未加载
评论 #27968937 未加载
kilodecaalmost 4 years ago
Title of the latest article:<p>&gt; How many engineers does it take to make subscripting work?<p>My question: How many engineers does it take to have horizontal scroller on overflow?
评论 #27970681 未加载
bob1029almost 4 years ago
No mention of the splay tree? I am a little disappointed. The locality of access and dynamic programming semantics are super compelling to me.
评论 #27973280 未加载