From: Bob Hutchison Date: 2006-08-11T20:38:55+09:00 Subject: Re: Looking for a Fast Persistent Store On Aug 9, 2006, at 11:32 PM, snacktime wrote: > On 8/9/06, Bob Hutchison wrote: >> Hi, >> >> I'm looking for a persistent store, where: >> * I can use it from Ruby >> * it is fast >> * it is transactional >> * it can update more than one store in a single transaction >> * simple String -> String mappings in the store are sufficient >> * ideally uses files in the filesystem >> >> These kinds of stores are normally implemented as persistent hashes >> or BTrees (or both). I know that Sleepycat's Berkeley DB > www.sleepycat.com/> does this, and I've used Java based systems that >> do this. I also know of some C based things but they don't have Ruby >> wrappers. I can't find anything in the Ruby world, and I don't care >> too much if it isn't pure Ruby. > > Why not use berkeleydb? There are ruby bindings for it. > The licensing cost of bdb for commercial re-distribution is prohibitive. Other than that, no reason. Cheers, Bob ---- Bob Hutchison -- blogs at Recursive Design Inc. -- Raconteur -- xampl for Ruby --