Sean, are those reads random or sequential? I'd think they'd be sequential during batch computation of recommendations, but I'm not sure.
Here are some numbers: http://wiki.apache.org/hadoop/Hbase/PerformanceEvaluation#0_2_0 Otis -- Sematext -- http://sematext.com/ -- Lucene - Solr - Nutch ----- Original Message ---- > From: Sean Owen <[EMAIL PROTECTED]> > To: [email protected] > Sent: Friday, August 29, 2008 2:49:33 AM > Subject: Re: Taste on Hbase? > > I admit I don't know much about HBase, but if I am right that it is > roughly like BigTable, then yeah it would be a better choice -- in > theory at least. The library just needs a very simple table, and very > fast access to it, almost entirely reads, few writes, no transactions. > I'll put it on the to-do list to build an implementation on HBase. > > On Fri, Aug 29, 2008 at 5:29 AM, Otis Gospodnetic > wrote: > > Hi, > > > > I was looking at some Hbase stuff earlier and I started wondering whether > Taste would benefit from using Hbase as its data store instead of a RDBMS. > Would it? Oh, now I see notes about DB/MySQL performance at the bottom of > this > section: http://lucene.apache.org/mahout/taste.html#Runtime+Performance > > > > Here is what I think is an easy to understand explanation of some of the > > Hbase > vs. RDBMS differences: > > > > http://markmail.org/message/fz6jhlph6bdvsrio > > > > I'm wondering what people more familiar with Hbase and Taste think about > > Taste > using Hbase as its data store. Would it be possible? Would it make anything > better? > > > > Thanks, > > Otis > > -- > > Sematext -- http://sematext.com/ -- Lucene - Solr - Nutch > > > >
