>> I suppose that a hash function which hash row key to physical address is more efficient.
Actually, I thought and consider about CAN (Content-Addressable Network) because BigTable has a immutable meta tree as a b+tree. I don't exactly know what do you think, but it is a revolutionary idea. If I may digress from my theme for a moment, For 30 years, The benefits of column-store development has been the subject of much/some debate. but, the availability of column-store has not been authenticated. And also, i couldn't proof an benefits of Hbase (BigTable clone) because there is an various alternative suggestions. But, I recently find a answer that they only made a BigTable for fun. On 3/6/08, Bin YANG <[EMAIL PROTECTED]> 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: [EMAIL PROTECTED] > -- B. Regards, Edward yoon @ NHN, corp.
