Chris, maybe this at least somehow will help you. In HBase everything depends on your row key design (specially look for openTSDB case). For example in your case key may look like the following:
[name-code] [counts-code] [...]
In this case you easily select range for all records having certain name / counts with Olog(n) complexity. If key doesn't include component calculated from size, you will have O(n) complexity searching for certain size. If key includes size (or at least some calculation based on size) this will speed up process as it allows you to limit range up to Olog(n).
HBase is very straightforward tool allowing you to perform magic things but only if you really know how it works and yes, it is something like 'raw engine' with minimal abstraction.
Please also note if you have lot of records per names
/ counts
field value you probably need to balance such request loading among cluster nodes. So this affects your table / row key design. For example I have now design where linear full scan of table with perfect loading balance is better than limited scan without balancing.