Multi-dimensional Range Queries Help

[Kevin Wright <ke...@gmail.com>]

Hi!

Our application requires fast read queries that specify two ranges. One
range on timestamps, and another on ids. We are currently using Apache
HBase as our db, but we’re unsure how to optimally design the row keys /
schemas. Currently, scanning over row key (the ids) with filter on
timeranges is taking more time than what we expect. A normal query would
probably have say 200 rows that match the id range, and about 10 rows that
match both ranges, and we have currently on the order of 10s of millions of
rows.

We’re wondering if there’s something we can do to increase throughput with
HBase (e.g., is there something like composite indexing like in MySQL?).
Not sure if this is the best place to ask this, but if anyone could point
us to the right direction, that would be great!

Thank you!