Hi, So I am new to this as well, but I think you would have to handle this in your insertion code manually. I believe work is underway to have indexes on the columns natively in HBase (I presume not lucene though).
Regarding anything after a date, perhaps you can use the timestamp for the row and then open a scanner with the filter "timestamp > x"? Cheers Tim On Sun, May 17, 2009 at 2:31 AM, Jamie Johnson <[email protected]> wrote: > Thanks, I am looking into this perhaps my question should have been a little > different though. > > If I am starting from scratch, nothing in the DB and want to keep a Lucene > index for information I add in hbase is there a way to build the index on > insertion instead of running a map reduce task after it has been inserted? > Or is there a way to specify only to index files after a certain date so > this task can be run periodically instead of having to reindex everything? > > Again I am very new to this so any help would be appreciated. > > On Sat, May 16, 2009 at 4:31 PM, tim robertson > <[email protected]>wrote: > >> There is an IndexTableReduce class in the HBase source that you might >> want to look at. >> >> Here is a basic example of usage: >> >> BuildTableIndex bti = new BuildTableIndex(); >> JobConf conf = new JobConf(TestBuildLucene.class); >> conf = bti.createJob(conf, 1, 1, "/tmp/lucene-hbase", >> "occurrence", >> "raw:CatalogueNo"); >> try { >> JobClient.runJob(conf); >> } catch (IOException e) { >> e.printStackTrace(); >> } >> >> // do a term query >> try { >> IndexReader reader = >> IndexReader.open("/tmp/lucene-hbase/part-00000"); >> >> Cheers, >> Tim >> >> >> >> >> On Sat, May 16, 2009 at 10:03 PM, Jamie Johnson <[email protected]> wrote: >> > I have seen several pages (most over a year old) which make reference to >> > building lucene indexes against hbase, is there any updated documentation >> > which can be used to do this, or an old document which is still valid? I >> am >> > new to the hbase world so any help on this would be greatly appreciated. >> > >> > Jamie >> > >> >
