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.

In-Memory Performance for Big Data (2014) [pdf]

29 pointsby lichtenbergerabout 6 years ago

3 comments

Rafuinoabout 6 years ago
Has this pointer swizzling concept been adapted by any big data-focused databases?<p>Would be interesting to see how this works with bigger pools of volatile and persistent memory (disclaimer: I work at Intel on Optane DC SSD&#x2F;PM-related things).
评论 #19792822 未加载
评论 #19792205 未加载
cl0ckt0werabout 6 years ago
Had to look this up:<p><a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Pointer_swizzling" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Pointer_swizzling</a>
评论 #19789302 未加载
mpweiherabout 6 years ago
Interesting, sounds a bit like the way write-barriers made the combination of copying garbage collectors and direct object pointers feasible.