Feedback on my implementation.

[Josh]

Greetings,

I am looking for some feedback on my use of HBase.

To allow matching on column values, I have put data into the column
family attribute name, for example:

colum-fam:attribute1:value1
colum-fam:attribute2:value2

This allows one to match values in the following way:

select colum-fam:attribute1:value1,colum-fam:attribute2:value2 from MyTable;

Programmatically, when I use:

table.obtainscanner(new Text[] { new
Text("colum-fam:attribute1:value1"), new
Text("colum-fam:attribute2:value2") }, new Text(""));

I get rows matching either value1 || value2, so I have logic that
looks for both columns in each row to ensure an exact match.

I am thinking this isn't an ideal implementation, as the scanner above
must walk every row in the table.

Any idea how this might scale?  Would adding RegionServers cut down on
the time it takes to walk the whole table?

Thanks for your input!