hadoop-common-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Michael Bieniosek <mich...@powerset.com>
Subject Re: Does HBase have a index?
Date Thu, 06 Mar 2008 19:09:01 GMT
hbase is a clone of bigtable: http://labs.google.com/papers/bigtable.html

There is a META table that contains a mapping from ranges of rows to a regionserver where
the row is stored.  Only the row key is indexed, and I don't think bigtable/hbase is designed
to have indexes on other attributes.

-Michael

On 3/6/08 12:39 AM, "Bin YANG" <yangbinisme82@gmail.com> wrote:

Dear colleagues,

I have a questions on HBase's index implementation.

How does the HBase find the data according to a row key? Use a index
like database, or use a hash function?
I suppose that a hash function which hash row key to physical address
is more efficient.

As we know, a big table in HBase is stored as several Small tables,
each table stores attributes in a column family.
So that, each row may be stored in several small tables.
Does a hash function hash row key to many physical address? Each
physical address correspond to a small table which contains the row
key?

Does anybody have idea on how to create a index on other attribute?

Best,
Bin YANG
--
Bin YANG
Department of Computer Science and Engineering
Fudan University
Shanghai, P. R. China
EMail: yangbinisme82@gmail.com



Mime
  • Unnamed multipart/alternative (inline, None, 0 bytes)
View raw message