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.

Diskstore and a new b-tree implementation

33 pointsby mattybover 14 years ago

4 comments

mumrahover 14 years ago
I could see one running out of inodes for a sizable dataset. Also, this seems like it would incur a good deal of iowait opening and closing all those fds.
评论 #2115989 未加载
snissnover 14 years ago
Are you familiar with memcachedb? it's a berkleyDB back behind memcache with a lru key destruction in memcache that persists to disk using berkley db... you definitely don't need to re-invent the wheel here, you can possibly use innoDB as a key val store also if you can find the source/binaries for it....
评论 #2116555 未加载
rb2k_over 14 years ago
Anybody tried using this on HFS+ in OSX? It was horribly slow for me, but it could also have been parameters in the conf that were bad.
评论 #2115997 未加载
agibover 14 years ago
Does anyone know the basic tradeoffs between the two stores?