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

科技回声

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

GitHubTwitter

首页

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

资源链接

HackerNews API原版 HackerNewsNext.js

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

The Inflatable Transpose Tree: a highly compact data structure

5 点作者 greenhathacker大约 9 年前

1 comment

rustcrumb大约 9 年前
The price you pay for this level of compression is the loss of locality of reference. Yes you fit all the data for your struct fields in the minimum amount of memory, but every field for a single object is going to live on a different cache line. This might be OK if you are only ever doing something to a single field at a time, but it might hurt if you are reading many fields of an object at once.
评论 #11663761 未加载